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/codeblockAssertOrder01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:35:55,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:35:55,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:35:55,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:35:55,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:35:55,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:35:55,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:35:55,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:35:55,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:35:55,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:35:55,030 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:35:55,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:35:55,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:35:55,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:35:55,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:35:55,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:35:55,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:35:55,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:35:55,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:35:55,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:35:55,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:35:55,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:35:55,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:35:55,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:35:55,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:35:55,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:35:55,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:35:55,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:35:55,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:35:55,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:35:55,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:35:55,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:35:55,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:35:55,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:35:55,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:35:55,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:35:55,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:35:55,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:35:55,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:35:55,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:35:55,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:35:55,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:35:55,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:35:55,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:35:55,108 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:35:55,108 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:35:55,109 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl [2019-08-05 10:35:55,109 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl' [2019-08-05 10:35:55,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:35:55,144 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:35:55,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:35:55,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:35:55,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:35:55,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:55" (1/1) ... [2019-08-05 10:35:55,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:55" (1/1) ... [2019-08-05 10:35:55,177 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:35:55,177 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:35:55,178 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:35:55,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:35:55,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:35:55,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:35:55,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:35:55,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:55" (1/1) ... [2019-08-05 10:35:55,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:55" (1/1) ... [2019-08-05 10:35:55,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:55" (1/1) ... [2019-08-05 10:35:55,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:55" (1/1) ... [2019-08-05 10:35:55,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:55" (1/1) ... [2019-08-05 10:35:55,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:55" (1/1) ... [2019-08-05 10:35:55,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:55" (1/1) ... [2019-08-05 10:35:55,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:35:55,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:35:55,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:35:55,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:35:55,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:35:55,271 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:35:55,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:35:55,506 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:35:55,507 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:35:55,508 INFO L202 PluginConnector]: Adding new model codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:35:55 BoogieIcfgContainer [2019-08-05 10:35:55,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:35:55,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:35:55,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:35:55,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:35:55,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:55" (1/2) ... [2019-08-05 10:35:55,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd6223e and model type codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:35:55, skipping insertion in model container [2019-08-05 10:35:55,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:35:55" (2/2) ... [2019-08-05 10:35:55,524 INFO L109 eAbstractionObserver]: Analyzing ICFG codeblockAssertOrder01.bpl [2019-08-05 10:35:55,538 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:35:55,546 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:35:55,562 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:35:55,584 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:35:55,585 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:35:55,585 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:35:55,585 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:35:55,586 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:35:55,586 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:35:55,586 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:35:55,586 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:35:55,586 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:35:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:35:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:35:55,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:55,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:35:55,610 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:55,616 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 10:35:55,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:55,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:35:55,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:55,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:35:55,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:35:55,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:35:55,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:35:55,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:35:55,803 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:35:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:55,840 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:35:55,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:35:55,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:35:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:55,853 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:35:55,853 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:35:55,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:35:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:35:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:35:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:35:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:35:55,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:35:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:55,888 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:35:55,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:35:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:35:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:35:55,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:55,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:35:55,889 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:55,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:55,890 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 10:35:55,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:55,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:35:55,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:56,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:56,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:35:56,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:35:56,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:35:56,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:35:56,031 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:35:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:56,109 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:35:56,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:35:56,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:35:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:56,111 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:35:56,112 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:35:56,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-05 10:35:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:35:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:35:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:35:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:35:56,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:35:56,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:56,116 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:35:56,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:35:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:35:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:35:56,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:56,117 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:35:56,118 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:56,118 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 10:35:56,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:56,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:35:56,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:56,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:56,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:35:56,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:35:56,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:35:56,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:35:56,255 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:35:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:56,319 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:35:56,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:35:56,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:35:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:56,321 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:35:56,321 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:35:56,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:35:56,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:35:56,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:35:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:35:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:35:56,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:35:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:56,325 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:35:56,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:35:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:35:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:35:56,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:56,326 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:35:56,327 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:56,327 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 10:35:56,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:56,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:35:56,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:56,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:56,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:35:56,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:35:56,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:35:56,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:35:56,427 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:35:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:56,449 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:35:56,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:35:56,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:35:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:56,451 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:35:56,451 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:35:56,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-05 10:35:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:35:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:35:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:35:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:35:56,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:35:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:56,454 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:35:56,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:35:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:35:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:35:56,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:56,455 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:35:56,456 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:56,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 10:35:56,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:56,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:35:56,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:56,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:56,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:35:56,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:35:56,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:35:56,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:35:56,618 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:35:56,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:56,749 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:35:56,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:35:56,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:35:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:56,750 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:35:56,750 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:35:56,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:35:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:35:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:35:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:35:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:35:56,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:35:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:56,754 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:35:56,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:35:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:35:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:35:56,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:56,755 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:35:56,755 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:56,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 10:35:56,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:56,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:35:56,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:56,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:56,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:35:56,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:35:56,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:35:56,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:35:56,908 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:35:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:56,979 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:35:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:35:56,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:35:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:56,980 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:35:56,980 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:35:56,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:35:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:35:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:35:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:35:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:35:56,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:35:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:56,983 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:35:56,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:35:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:35:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:35:56,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:56,984 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:35:56,985 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:56,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:56,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 10:35:56,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:56,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:35:57,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:57,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:57,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:35:57,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:35:57,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:35:57,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:35:57,215 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:35:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:57,271 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:35:57,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:35:57,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:35:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:57,272 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:35:57,272 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:35:57,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:35:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:35:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:35:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:35:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:35:57,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:35:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:57,276 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:35:57,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:35:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:35:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:35:57,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:57,277 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:35:57,277 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:57,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:57,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-05 10:35:57,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:57,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:35:57,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:57,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:57,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:35:57,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:35:57,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:35:57,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:35:57,389 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:35:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:57,460 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:35:57,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:35:57,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:35:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:57,461 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:35:57,461 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:35:57,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-05 10:35:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:35:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:35:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:35:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:35:57,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:35:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:57,464 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:35:57,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:35:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:35:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:35:57,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:57,465 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:35:57,465 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:57,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:57,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-05 10:35:57,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:57,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:35:57,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:57,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:57,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:35:57,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:35:57,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:35:57,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:57,937 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:35:57,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:57,976 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:35:57,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:35:57,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:35:57,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:57,977 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:35:57,977 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:35:57,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:57,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:35:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:35:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:35:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:35:57,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:35:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:57,981 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:35:57,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:35:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:35:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:35:57,982 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:57,982 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:35:57,982 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:57,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:57,982 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-05 10:35:57,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:57,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:35:57,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:58,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:58,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:35:58,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:35:58,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:35:58,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:58,144 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:35:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:58,198 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:35:58,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:35:58,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:35:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:58,202 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:35:58,203 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:35:58,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:35:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:35:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:35:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:35:58,206 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:35:58,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:58,207 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:35:58,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:35:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:35:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:35:58,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:58,208 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:35:58,208 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:58,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:58,208 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2019-08-05 10:35:58,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:58,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:35:58,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:58,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:58,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:35:58,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:35:58,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:35:58,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:58,395 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:35:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:58,436 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:35:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:35:58,437 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:35:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:58,438 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:35:58,438 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:35:58,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:35:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:35:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:35:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:35:58,442 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:35:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:58,443 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:35:58,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:35:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:35:58,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:35:58,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:58,444 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:35:58,444 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:58,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:58,444 INFO L82 PathProgramCache]: Analyzing trace with hash 581150598, now seen corresponding path program 11 times [2019-08-05 10:35:58,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:58,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:35:58,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:58,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:58,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:35:58,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:35:58,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:35:58,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:58,698 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:35:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:58,766 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:35:58,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:35:58,766 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:35:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:58,767 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:35:58,767 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:35:58,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:35:58,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:35:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:35:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:35:58,771 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:35:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:58,771 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:35:58,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:35:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:35:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:35:58,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:58,772 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:35:58,772 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash 835797408, now seen corresponding path program 12 times [2019-08-05 10:35:58,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:58,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:35:58,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:58,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:58,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:35:58,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:35:58,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:35:58,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:58,948 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:35:58,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:58,983 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:35:58,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:35:58,983 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:35:58,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:58,984 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:35:58,984 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:35:58,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:35:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:35:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:35:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:35:58,988 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:35:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:58,988 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:35:58,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:35:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:35:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:35:58,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:58,989 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:35:58,989 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:58,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:58,990 INFO L82 PathProgramCache]: Analyzing trace with hash 139913926, now seen corresponding path program 13 times [2019-08-05 10:35:58,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:59,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:35:59,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:59,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:59,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:35:59,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:35:59,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:35:59,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:59,202 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:35:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:59,224 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:35:59,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:35:59,224 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:35:59,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:59,225 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:35:59,225 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:35:59,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 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-05 10:35:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:35:59,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:35:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:35:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:35:59,230 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:35:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:59,230 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:35:59,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:35:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:35:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:35:59,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:59,231 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:35:59,231 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:59,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:59,231 INFO L82 PathProgramCache]: Analyzing trace with hash 42362464, now seen corresponding path program 14 times [2019-08-05 10:35:59,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:59,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:35:59,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:59,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:59,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:35:59,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:35:59,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:35:59,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:59,533 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:35:59,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:59,634 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:35:59,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:35:59,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:35:59,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:59,636 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:35:59,636 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:35:59,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:35:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:35:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:35:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:35:59,639 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:35:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:59,640 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:35:59,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:35:59,640 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:35:59,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:35:59,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:59,641 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:35:59,641 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:59,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234438, now seen corresponding path program 15 times [2019-08-05 10:35:59,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:59,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:35:59,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:00,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:00,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:36:00,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:36:00,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:36:00,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:36:00,036 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:36:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:00,319 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:36:00,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:36:00,320 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:36:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:00,321 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:36:00,321 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:36:00,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 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-05 10:36:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:36:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:36:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:36:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:36:00,324 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:36:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:00,324 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:36:00,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:36:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:36:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:36:00,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:00,326 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:36:00,326 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:00,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:00,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559968, now seen corresponding path program 16 times [2019-08-05 10:36:00,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:00,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:36:00,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:00,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:00,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:36:00,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:36:00,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:36:00,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:36:00,529 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:36:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:00,577 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:36:00,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:36:00,578 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:36:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:00,578 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:36:00,578 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:36:00,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:36:00,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:36:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:36:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:36:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:36:00,582 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:36:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:00,582 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:36:00,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:36:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:36:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:36:00,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:00,583 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:36:00,583 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:00,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:00,583 INFO L82 PathProgramCache]: Analyzing trace with hash -702152378, now seen corresponding path program 17 times [2019-08-05 10:36:00,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:00,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:36:00,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:01,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:01,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:36:01,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:36:01,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:36:01,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:36:01,164 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:36:01,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:01,198 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:36:01,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:36:01,205 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:36:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:01,206 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:36:01,206 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:36:01,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:36:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:36:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:36:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:36:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:36:01,209 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:36:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:01,210 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:36:01,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:36:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:36:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:36:01,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:01,211 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:36:01,211 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:01,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:01,211 INFO L82 PathProgramCache]: Analyzing trace with hash -291889184, now seen corresponding path program 18 times [2019-08-05 10:36:01,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:01,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:36:01,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:01,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:01,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:36:01,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:36:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:36:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:36:01,662 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:36:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:01,700 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:36:01,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:36:01,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:36:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:01,701 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:36:01,702 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:36:01,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:36:01,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:36:01,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:36:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:36:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:36:01,707 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:36:01,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:01,708 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:36:01,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:36:01,708 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:36:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:36:01,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:01,709 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:36:01,709 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:01,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:01,710 INFO L82 PathProgramCache]: Analyzing trace with hash -458632058, now seen corresponding path program 19 times [2019-08-05 10:36:01,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:01,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:36:01,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:02,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:02,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:36:02,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:36:02,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:36:02,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:36:02,037 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:36:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:02,063 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:36:02,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:36:02,068 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:36:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:02,068 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:36:02,068 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:36:02,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:36:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:36:02,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:36:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:36:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:36:02,072 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:36:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:02,072 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:36:02,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:36:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:36:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:36:02,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:02,073 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:36:02,073 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:02,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:02,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693856, now seen corresponding path program 20 times [2019-08-05 10:36:02,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:02,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:36:02,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:02,381 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-05 10:36:02,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:02,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:36:02,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:36:02,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:36:02,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:36:02,383 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:36:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:02,418 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:36:02,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:36:02,419 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:36:02,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:02,420 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:36:02,420 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:36:02,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:36:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:36:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:36:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:36:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:36:02,424 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:36:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:02,424 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:36:02,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:36:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:36:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:36:02,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:02,425 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:36:02,425 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:02,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161478, now seen corresponding path program 21 times [2019-08-05 10:36:02,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:02,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:36:02,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:02,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:02,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:36:02,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:36:02,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:36:02,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:36:02,966 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:36:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:03,005 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:36:03,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:36:03,008 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:36:03,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:03,009 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:36:03,009 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:36:03,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:36:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:36:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:36:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:36:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:36:03,012 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:36:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:03,012 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:36:03,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:36:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:36:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:36:03,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:03,013 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:36:03,013 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:03,014 INFO L82 PathProgramCache]: Analyzing trace with hash -818603680, now seen corresponding path program 22 times [2019-08-05 10:36:03,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:03,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:36:03,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:03,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:03,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:36:03,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:36:03,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:36:03,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:36:03,480 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:36:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:03,534 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:36:03,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:36:03,534 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:36:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:03,535 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:36:03,535 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:36:03,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:36:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:36:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:36:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:36:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:36:03,540 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:36:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:03,540 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:36:03,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:36:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:36:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:36:03,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:03,541 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:36:03,541 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:03,541 INFO L82 PathProgramCache]: Analyzing trace with hash 393087750, now seen corresponding path program 23 times [2019-08-05 10:36:03,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:03,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:36:03,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:04,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:04,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:36:04,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:36:04,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:36:04,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:36:04,041 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:36:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:04,107 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:36:04,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:36:04,107 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:36:04,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:04,108 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:36:04,108 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:36:04,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:36:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:36:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:36:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:36:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:36:04,113 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:36:04,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:04,113 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:36:04,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:36:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:36:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:36:04,114 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:04,114 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:36:04,114 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:04,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:04,114 INFO L82 PathProgramCache]: Analyzing trace with hash -699183584, now seen corresponding path program 24 times [2019-08-05 10:36:04,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:04,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:36:04,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:04,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:04,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:36:04,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:36:04,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:36:04,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:36:04,772 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:36:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:04,824 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:36:04,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:36:04,825 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:36:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:04,826 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:36:04,826 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:36:04,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:36:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:36:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:36:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:36:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:36:04,832 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:36:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:04,833 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:36:04,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:36:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:36:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:36:04,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:04,834 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:36:04,834 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:04,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:04,835 INFO L82 PathProgramCache]: Analyzing trace with hash -199856570, now seen corresponding path program 25 times [2019-08-05 10:36:04,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:04,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:36:04,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:05,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:05,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:36:05,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:36:05,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:36:05,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:36:05,367 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:36:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:05,413 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:36:05,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:36:05,414 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:36:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:05,415 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:36:05,415 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:36:05,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:36:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:36:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:36:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:36:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:36:05,418 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:36:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:05,418 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:36:05,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:36:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:36:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:36:05,419 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:05,419 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:36:05,419 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:05,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:05,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588320, now seen corresponding path program 26 times [2019-08-05 10:36:05,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:05,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:36:05,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:06,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:06,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:36:06,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:36:06,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:36:06,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:36:06,151 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:36:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:06,288 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:36:06,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:36:06,289 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:36:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:06,290 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:36:06,290 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:36:06,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:36:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:36:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:36:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:36:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:36:06,293 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:36:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:06,293 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:36:06,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:36:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:36:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:36:06,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:06,294 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:36:06,294 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:06,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302278, now seen corresponding path program 27 times [2019-08-05 10:36:06,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:06,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:36:06,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:06,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:06,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:36:06,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:36:06,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:36:06,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:36:06,758 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:36:06,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:06,817 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:36:06,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:36:06,818 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:36:06,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:06,819 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:36:06,819 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:36:06,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:36:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:36:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:36:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:36:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:36:06,824 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:36:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:06,824 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:36:06,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:36:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:36:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:36:06,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:06,825 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:36:06,825 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:06,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336992, now seen corresponding path program 28 times [2019-08-05 10:36:06,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:06,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:36:06,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:07,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:07,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:36:07,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:36:07,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:36:07,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:36:07,265 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:36:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:07,345 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:36:07,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:36:07,346 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:36:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:07,347 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:36:07,347 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:36:07,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:36:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:36:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:36:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:36:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:36:07,350 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:36:07,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:07,351 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:36:07,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:36:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:36:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:36:07,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:07,352 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:36:07,352 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash 125289670, now seen corresponding path program 29 times [2019-08-05 10:36:07,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:07,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:36:07,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:07,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:07,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:36:07,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:36:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:36:07,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:36:07,964 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:36:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:08,077 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:36:08,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:36:08,081 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:36:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:08,082 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:36:08,082 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:36:08,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:36:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:36:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:36:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:36:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:36:08,091 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:36:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:08,092 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:36:08,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:36:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:36:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:36:08,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:08,092 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:36:08,093 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:08,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:08,093 INFO L82 PathProgramCache]: Analyzing trace with hash -410989472, now seen corresponding path program 30 times [2019-08-05 10:36:08,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:08,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:36:08,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:08,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:08,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:36:08,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:36:08,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:36:08,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:36:08,560 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:36:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:08,606 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:36:08,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:36:08,607 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:36:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:08,607 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:36:08,607 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:36:08,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:36:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:36:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:36:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:36:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:36:08,611 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:36:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:08,611 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:36:08,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:36:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:36:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:36:08,612 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:08,612 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:36:08,612 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:08,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:08,613 INFO L82 PathProgramCache]: Analyzing trace with hash 144226310, now seen corresponding path program 31 times [2019-08-05 10:36:08,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:08,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:36:08,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:09,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:09,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:36:09,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:36:09,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:36:09,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:36:09,221 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:36:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:09,272 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:36:09,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:36:09,272 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:36:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:09,273 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:36:09,273 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:36:09,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:36:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:36:09,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:36:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:36:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:36:09,277 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:36:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:09,277 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:36:09,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:36:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:36:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:36:09,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:09,278 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:36:09,278 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:09,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:09,279 INFO L82 PathProgramCache]: Analyzing trace with hash 176046368, now seen corresponding path program 32 times [2019-08-05 10:36:09,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:09,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:36:09,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:09,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:09,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:36:09,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:36:09,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:36:09,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:36:09,728 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:36:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:09,765 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:36:09,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:36:09,766 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:36:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:09,767 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:36:09,767 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:36:09,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 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-05 10:36:09,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:36:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:36:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:36:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:36:09,771 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:36:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:09,771 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:36:09,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:36:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:36:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:36:09,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:09,772 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:36:09,772 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:09,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:09,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468166, now seen corresponding path program 33 times [2019-08-05 10:36:09,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:09,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:36:09,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:10,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:10,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:36:10,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:36:10,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:36:10,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:10,422 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:36:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:10,501 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:36:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:36:10,501 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:36:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:10,502 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:36:10,502 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:36:10,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:36:10,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:36:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:36:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:36:10,505 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:36:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:10,505 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:36:10,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:36:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:36:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:36:10,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:10,506 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:36:10,506 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:10,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:10,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772832, now seen corresponding path program 34 times [2019-08-05 10:36:10,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:10,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:36:10,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:12,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:12,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:36:12,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:36:12,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:36:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:12,037 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:36:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:12,077 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:36:12,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:36:12,078 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:36:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:12,079 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:36:12,079 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:36:12,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:36:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:36:12,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:36:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:36:12,083 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:36:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:12,083 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:36:12,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:36:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:36:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:36:12,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:12,085 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:36:12,086 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:12,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:12,086 INFO L82 PathProgramCache]: Analyzing trace with hash 440348294, now seen corresponding path program 35 times [2019-08-05 10:36:12,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:12,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:36:12,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:12,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:12,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:36:12,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:36:12,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:36:12,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:12,585 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:36:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:12,674 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:36:12,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:36:12,674 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:36:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:12,675 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:36:12,675 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:36:12,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 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-05 10:36:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:36:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:36:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:36:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:36:12,678 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:36:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:12,679 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:36:12,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:36:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:36:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:36:12,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:12,679 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:36:12,679 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:12,680 INFO L82 PathProgramCache]: Analyzing trace with hash 765893280, now seen corresponding path program 36 times [2019-08-05 10:36:12,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:12,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:36:12,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:14,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:14,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:36:14,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:36:14,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:36:14,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:14,549 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:36:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:14,591 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:36:14,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:36:14,591 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:36:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:14,592 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:36:14,592 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:36:14,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:36:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:36:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:36:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:36:14,596 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:36:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:14,596 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:36:14,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:36:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:36:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:36:14,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:14,597 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:36:14,597 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:14,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114042, now seen corresponding path program 37 times [2019-08-05 10:36:14,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:14,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:36:14,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:15,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:15,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:36:15,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:36:15,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:36:15,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:15,323 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:36:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:15,389 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:36:15,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:36:15,390 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:36:15,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:15,390 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:36:15,390 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:36:15,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:36:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:36:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:36:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:36:15,394 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:36:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:15,394 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:36:15,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:36:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:36:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:36:15,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:15,395 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:36:15,396 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:15,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:15,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972192, now seen corresponding path program 38 times [2019-08-05 10:36:15,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:15,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:36:15,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:16,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:16,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:36:16,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:36:16,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:36:16,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:16,068 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:36:16,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:16,116 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:36:16,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:36:16,116 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:36:16,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:16,117 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:36:16,117 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:36:16,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:36:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:36:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:36:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:36:16,121 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:36:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:16,122 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:36:16,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:36:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:36:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:36:16,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:16,122 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:36:16,123 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:16,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:16,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495750, now seen corresponding path program 39 times [2019-08-05 10:36:16,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:16,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:36:16,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:16,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:16,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:36:16,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:36:16,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:36:16,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:16,731 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:36:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:16,781 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:36:16,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:36:16,781 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:36:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:16,782 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:36:16,782 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:36:16,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 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-05 10:36:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:36:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:36:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:36:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:36:16,784 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:36:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:16,785 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:36:16,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:36:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:36:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:36:16,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:16,785 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:36:16,785 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:16,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:16,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791456, now seen corresponding path program 40 times [2019-08-05 10:36:16,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:16,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:36:16,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:17,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:17,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:36:17,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:36:17,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:36:17,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:36:17,510 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:36:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:17,578 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:36:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:36:17,578 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:36:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:17,579 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:36:17,579 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:36:17,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 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-05 10:36:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:36:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:36:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:36:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:36:17,582 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:36:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:17,582 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:36:17,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:36:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:36:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:36:17,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:17,583 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:36:17,583 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:17,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:17,583 INFO L82 PathProgramCache]: Analyzing trace with hash -692041658, now seen corresponding path program 41 times [2019-08-05 10:36:17,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:17,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:36:17,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:18,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:18,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:36:18,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:36:18,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:36:18,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:36:18,562 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:36:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:18,664 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:36:18,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:36:18,665 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:36:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:18,665 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:36:18,665 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:36:18,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:36:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:36:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:36:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:36:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:36:18,668 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:36:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:18,669 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:36:18,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:36:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:36:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:36:18,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:18,670 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:36:18,670 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:18,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:18,670 INFO L82 PathProgramCache]: Analyzing trace with hash 21543136, now seen corresponding path program 42 times [2019-08-05 10:36:18,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:18,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:36:18,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:19,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:19,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:36:19,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:36:19,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:36:19,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:36:19,625 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:36:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:19,675 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:36:19,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:36:19,676 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:36:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:19,677 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:36:19,677 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:36:19,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:36:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:36:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:36:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:36:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:36:19,681 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:36:19,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:19,681 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:36:19,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:36:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:36:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:36:19,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:19,682 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:36:19,682 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:19,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:19,683 INFO L82 PathProgramCache]: Analyzing trace with hash 667835270, now seen corresponding path program 43 times [2019-08-05 10:36:19,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:19,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:36:19,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:20,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:20,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:36:20,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:36:20,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:36:20,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:36:20,435 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:36:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:20,543 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:36:20,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:36:20,544 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:36:20,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:20,545 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:36:20,545 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:36:20,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 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-05 10:36:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:36:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:36:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:36:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:36:20,547 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:36:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:20,547 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:36:20,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:36:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:36:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:36:20,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:20,548 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:36:20,548 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:20,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:20,548 INFO L82 PathProgramCache]: Analyzing trace with hash -771945056, now seen corresponding path program 44 times [2019-08-05 10:36:20,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:20,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:36:20,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:21,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:21,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:36:21,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:36:21,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:36:21,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:36:21,361 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:36:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:21,432 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:36:21,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:36:21,433 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:36:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:21,434 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:36:21,434 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:36:21,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 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-05 10:36:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:36:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:36:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:36:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:36:21,437 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:36:21,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:21,438 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:36:21,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:36:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:36:21,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:36:21,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:21,439 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:36:21,439 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:21,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:21,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505094, now seen corresponding path program 45 times [2019-08-05 10:36:21,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:21,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:36:21,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:22,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:22,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:36:22,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:36:22,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:36:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:36:22,445 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:36:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:22,769 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:36:22,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:36:22,770 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:36:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:22,771 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:36:22,771 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:36:22,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:36:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:36:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:36:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:36:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:36:22,774 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:36:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:22,775 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:36:22,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:36:22,775 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:36:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:36:22,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:22,775 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:36:22,776 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:22,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081120, now seen corresponding path program 46 times [2019-08-05 10:36:22,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:22,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:36:22,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:24,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:24,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:36:24,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:36:24,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:36:24,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:36:24,108 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:36:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:24,167 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:36:24,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:36:24,168 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:36:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:24,169 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:36:24,169 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:36:24,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:36:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:36:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:36:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:36:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:36:24,171 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:36:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:24,172 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:36:24,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:36:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:36:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:36:24,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:24,173 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:36:24,173 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:24,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:24,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192890, now seen corresponding path program 47 times [2019-08-05 10:36:24,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:24,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:36:24,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:25,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:25,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:36:25,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:36:25,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:36:25,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:36:25,004 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:36:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:25,060 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:36:25,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:36:25,061 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:36:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:25,061 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:36:25,062 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:36:25,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 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-05 10:36:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:36:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:36:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:36:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:36:25,065 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:36:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:25,065 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:36:25,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:36:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:36:25,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:36:25,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:25,066 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:36:25,066 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:25,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:25,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593312, now seen corresponding path program 48 times [2019-08-05 10:36:25,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:25,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:36:25,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:25,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:25,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:36:25,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:36:25,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:36:25,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:36:25,973 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:36:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:26,046 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:36:26,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:36:26,046 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:36:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:26,047 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:36:26,047 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:36:26,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 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-05 10:36:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:36:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:36:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:36:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:36:26,051 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:36:26,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:26,051 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:36:26,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:36:26,051 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:36:26,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:36:26,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:26,052 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:36:26,052 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:26,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:26,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314938, now seen corresponding path program 49 times [2019-08-05 10:36:26,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:26,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:36:26,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:26,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:26,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:36:26,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:36:26,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:36:26,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:36:26,975 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:36:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:27,029 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:36:27,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:36:27,029 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:36:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:27,030 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:36:27,030 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:36:27,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:36:27,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:36:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:36:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:36:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:36:27,033 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:36:27,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:27,034 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:36:27,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:36:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:36:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:36:27,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:27,034 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:36:27,035 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash -105059360, now seen corresponding path program 50 times [2019-08-05 10:36:27,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:27,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:36:27,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:28,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:28,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:36:28,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:36:28,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:36:28,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:36:28,604 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:36:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:28,678 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:36:28,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:36:28,679 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:36:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:28,680 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:36:28,680 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:36:28,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:36:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:36:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:36:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:36:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:36:28,683 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:36:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:28,683 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:36:28,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:36:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:36:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:36:28,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:28,684 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:36:28,684 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:28,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125190, now seen corresponding path program 51 times [2019-08-05 10:36:28,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:28,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:36:28,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:29,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:29,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:36:29,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:36:29,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:36:29,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:36:29,925 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:36:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:30,032 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:36:30,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:36:30,033 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:36:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:30,034 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:36:30,034 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:36:30,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:36:30,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:36:30,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:36:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:36:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:36:30,037 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:36:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:30,038 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:36:30,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:36:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:36:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:36:30,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:30,038 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:36:30,039 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:30,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107872, now seen corresponding path program 52 times [2019-08-05 10:36:30,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:30,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:36:30,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:31,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:31,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:36:31,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:36:31,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:36:31,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:36:31,082 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:36:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:31,159 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:36:31,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:36:31,159 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:36:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:31,159 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:36:31,160 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:36:31,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 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-05 10:36:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:36:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:36:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:36:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:36:31,164 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:36:31,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:31,164 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:36:31,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:36:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:36:31,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:36:31,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:31,165 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:36:31,165 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:31,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832646, now seen corresponding path program 53 times [2019-08-05 10:36:31,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:31,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:36:31,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:32,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:32,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:36:32,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:36:32,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:36:32,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:36:32,306 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:36:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:32,372 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:36:32,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:36:32,373 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:36:32,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:32,373 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:36:32,374 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:36:32,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:36:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:36:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:36:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:36:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:36:32,377 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:36:32,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:32,377 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:36:32,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:36:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:36:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:36:32,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:32,378 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:36:32,379 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:32,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:32,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895584, now seen corresponding path program 54 times [2019-08-05 10:36:32,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:32,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:36:32,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:33,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:33,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:36:33,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:36:33,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:36:33,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:36:33,923 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:36:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:34,000 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:36:34,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:36:34,000 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:36:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:34,001 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:36:34,001 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:36:34,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 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-05 10:36:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:36:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:36:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:36:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:36:34,004 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:36:34,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:34,004 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:36:34,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:36:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:36:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:36:34,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:34,005 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:36:34,005 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:34,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:34,005 INFO L82 PathProgramCache]: Analyzing trace with hash -836059386, now seen corresponding path program 55 times [2019-08-05 10:36:34,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:34,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:36:34,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:35,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:35,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:36:35,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:36:35,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:36:35,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:36:35,103 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:36:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:35,181 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:36:35,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:36:35,183 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:36:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:35,184 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:36:35,184 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:36:35,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:36:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:36:35,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:36:35,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:36:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:36:35,186 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:36:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:35,187 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:36:35,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:36:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:36:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:36:35,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:35,187 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:36:35,188 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:35,188 INFO L82 PathProgramCache]: Analyzing trace with hash -148039136, now seen corresponding path program 56 times [2019-08-05 10:36:35,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:35,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:36:35,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:36,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:36,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:36:36,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:36:36,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:36:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:36:36,338 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:36:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:36,408 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:36:36,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:36:36,408 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:36:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:36,409 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:36:36,410 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:36:36,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:36:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:36:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:36:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:36:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:36:36,413 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:36:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:36,414 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:36:36,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:36:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:36:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:36:36,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:36,415 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:36:36,415 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:36,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:36,415 INFO L82 PathProgramCache]: Analyzing trace with hash -294247866, now seen corresponding path program 57 times [2019-08-05 10:36:36,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:36,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:36:36,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:37,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:37,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:36:37,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:36:37,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:36:37,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:36:37,722 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:36:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:37,788 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:36:37,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:36:37,788 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:36:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:37,789 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:36:37,789 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:36:37,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:36:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:36:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:36:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:36:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:36:37,793 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:36:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:37,794 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:36:37,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:36:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:36:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:36:37,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:37,795 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:36:37,795 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:37,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:37,795 INFO L82 PathProgramCache]: Analyzing trace with hash -531751200, now seen corresponding path program 58 times [2019-08-05 10:36:37,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:37,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:36:37,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:39,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:39,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:36:39,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:36:39,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:36:39,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:36:39,303 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:36:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:39,369 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:36:39,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:36:39,369 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:36:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:39,370 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:36:39,370 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:36:39,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:36:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:36:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:36:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:36:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:36:39,372 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:36:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:39,373 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:36:39,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:36:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:36:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:36:39,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:39,373 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:36:39,373 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:39,373 INFO L82 PathProgramCache]: Analyzing trace with hash 695580038, now seen corresponding path program 59 times [2019-08-05 10:36:39,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:39,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:36:39,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:40,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:40,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:36:40,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:36:40,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:36:40,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:36:40,710 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:36:40,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:40,794 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:36:40,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:36:40,794 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:36:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:40,795 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:36:40,795 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:36:40,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:36:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:36:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:36:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:36:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:36:40,798 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:36:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:40,798 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:36:40,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:36:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:36:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:36:40,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:40,799 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:36:40,800 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:40,800 INFO L82 PathProgramCache]: Analyzing trace with hash 88142752, now seen corresponding path program 60 times [2019-08-05 10:36:40,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:40,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:36:40,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:42,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:42,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:36:42,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:36:42,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:36:42,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:36:42,156 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:36:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:42,244 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:36:42,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:36:42,245 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:36:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:42,246 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:36:42,246 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:36:42,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:36:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:36:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:36:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:36:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:36:42,249 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:36:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:42,249 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:36:42,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:36:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:36:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:36:42,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:42,250 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:36:42,250 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:42,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543930, now seen corresponding path program 61 times [2019-08-05 10:36:42,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:42,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:36:42,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:43,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:43,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:36:43,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:36:43,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:36:43,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:36:43,988 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:36:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:44,088 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:36:44,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:36:44,089 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:36:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:44,089 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:36:44,090 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:36:44,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:36:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:36:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:36:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:36:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:36:44,092 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:36:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:44,092 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:36:44,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:36:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:36:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:36:44,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:44,093 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:36:44,093 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:44,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223520, now seen corresponding path program 62 times [2019-08-05 10:36:44,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:44,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:36:44,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:45,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:45,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:36:45,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:36:45,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:36:45,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:36:45,595 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:36:45,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:45,686 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:36:45,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:36:45,687 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:36:45,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:45,688 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:36:45,688 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:36:45,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:36:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:36:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:36:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:36:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:36:45,691 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:36:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:45,691 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:36:45,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:36:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:36:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:36:45,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:45,692 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:36:45,692 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:45,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774598, now seen corresponding path program 63 times [2019-08-05 10:36:45,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:45,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:36:45,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:47,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:47,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:36:47,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:36:47,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:36:47,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:36:47,117 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:36:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:47,217 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:36:47,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:36:47,218 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:36:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:47,219 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:36:47,219 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:36:47,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:36:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:36:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:36:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:36:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:36:47,222 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:36:47,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:47,223 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:36:47,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:36:47,223 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:36:47,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:36:47,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:47,223 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:36:47,224 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:47,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:47,224 INFO L82 PathProgramCache]: Analyzing trace with hash -892596960, now seen corresponding path program 64 times [2019-08-05 10:36:47,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:47,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:36:47,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:49,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:49,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:36:49,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:36:49,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:36:49,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:36:49,318 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:36:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:49,423 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:36:49,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:36:49,423 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:36:49,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:49,424 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:36:49,424 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:36:49,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:36:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:36:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:36:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:36:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:36:49,427 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:36:49,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:49,427 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:36:49,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:36:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:36:49,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:36:49,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:49,428 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:36:49,428 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:49,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:49,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703930, now seen corresponding path program 65 times [2019-08-05 10:36:49,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:49,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:36:49,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:51,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:51,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:36:51,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:36:51,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:36:51,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:36:51,053 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:36:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:51,135 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:36:51,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:36:51,136 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:36:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:51,137 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:36:51,137 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:36:51,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:36:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:36:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:36:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:36:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:36:51,140 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:36:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:51,140 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:36:51,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:36:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:36:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:36:51,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:51,141 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:36:51,141 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718368, now seen corresponding path program 66 times [2019-08-05 10:36:51,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:51,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:36:51,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:52,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:52,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:36:52,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:36:52,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:36:52,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:36:52,747 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:36:52,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:52,832 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:36:52,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:36:52,833 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:36:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:52,834 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:36:52,834 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:36:52,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:36:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:36:52,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:36:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:36:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:36:52,837 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:36:52,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:52,837 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:36:52,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:36:52,837 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:36:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:36:52,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:52,838 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:36:52,838 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:52,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:52,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438202, now seen corresponding path program 67 times [2019-08-05 10:36:52,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:52,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:36:52,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:54,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:54,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:36:54,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:36:54,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:36:54,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:36:54,835 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:36:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:54,930 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:36:54,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:36:54,930 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:36:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:54,931 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:36:54,931 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:36:54,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:36:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:36:54,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:36:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:36:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:36:54,934 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:36:54,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:54,934 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:36:54,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:36:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:36:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:36:54,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:54,935 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:36:54,935 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:54,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:54,935 INFO L82 PathProgramCache]: Analyzing trace with hash 976119456, now seen corresponding path program 68 times [2019-08-05 10:36:54,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:54,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:36:54,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:56,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:56,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:36:56,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:36:56,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:36:56,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:36:56,652 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:36:56,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:56,735 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:36:56,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:36:56,735 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:36:56,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:56,736 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:36:56,736 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:36:56,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:36:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:36:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:36:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:36:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:36:56,739 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:36:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:56,740 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:36:56,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:36:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:36:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:36:56,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:56,740 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:36:56,741 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:56,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:56,741 INFO L82 PathProgramCache]: Analyzing trace with hash 194930118, now seen corresponding path program 69 times [2019-08-05 10:36:56,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:56,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:36:56,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:59,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:59,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:36:59,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:36:59,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:36:59,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:36:59,505 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:36:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:59,598 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:36:59,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:36:59,599 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:36:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:59,600 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:36:59,600 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:36:59,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:36:59,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:36:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:36:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:36:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:36:59,604 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:36:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:59,605 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:36:59,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:36:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:36:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:36:59,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:59,605 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:36:59,606 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:59,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:59,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864416, now seen corresponding path program 70 times [2019-08-05 10:36:59,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:59,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:36:59,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:01,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:01,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:37:01,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:37:01,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:37:01,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:37:01,415 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:37:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:01,540 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:37:01,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:37:01,541 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:37:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:01,542 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:37:01,542 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:37:01,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:37:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:37:01,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:37:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:37:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:37:01,546 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:37:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:01,546 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:37:01,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:37:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:37:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:37:01,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:01,547 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:37:01,547 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:01,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:01,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779898, now seen corresponding path program 71 times [2019-08-05 10:37:01,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:01,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:37:01,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:03,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:03,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:37:03,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:37:03,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:37:03,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:37:03,747 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:37:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:03,835 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:37:03,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:37:03,836 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:37:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:03,837 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:37:03,837 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:37:03,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:37:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:37:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:37:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:37:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:37:03,841 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:37:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:03,841 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:37:03,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:37:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:37:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:37:03,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:03,842 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:37:03,842 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:03,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:03,843 INFO L82 PathProgramCache]: Analyzing trace with hash 365428768, now seen corresponding path program 72 times [2019-08-05 10:37:03,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:03,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:37:03,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:06,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:06,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:37:06,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:37:06,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:37:06,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:37:06,088 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:37:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:06,198 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:37:06,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:37:06,198 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:37:06,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:06,199 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:37:06,200 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:37:06,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:37:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:37:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:37:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:37:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:37:06,203 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:37:06,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:06,203 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:37:06,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:37:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:37:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:37:06,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:06,204 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:37:06,204 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:06,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:06,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612026, now seen corresponding path program 73 times [2019-08-05 10:37:06,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:06,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:37:06,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:08,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:08,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:37:08,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:37:08,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:37:08,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:37:08,488 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:37:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:08,581 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:37:08,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:37:08,582 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:37:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:08,583 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:37:08,583 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:37:08,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:37:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:37:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:37:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:37:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:37:08,586 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:37:08,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:08,586 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:37:08,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:37:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:37:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:37:08,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:08,587 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:37:08,587 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:08,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:08,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334496, now seen corresponding path program 74 times [2019-08-05 10:37:08,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:08,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:37:08,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:10,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:10,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:37:10,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:37:10,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:37:10,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:37:10,839 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:37:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:10,928 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:37:10,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:37:10,928 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:37:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:10,929 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:37:10,929 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:37:10,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:37:10,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:37:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:37:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:37:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:37:10,932 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:37:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:10,932 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:37:10,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:37:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:37:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:37:10,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:10,933 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:37:10,933 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:10,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600250, now seen corresponding path program 75 times [2019-08-05 10:37:10,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:10,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:37:10,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:12,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:12,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:37:12,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:37:12,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:37:12,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:37:12,947 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:37:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:13,047 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:37:13,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:37:13,047 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:37:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:13,048 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:37:13,048 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:37:13,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:37:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:37:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:37:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:37:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:37:13,051 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:37:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:13,052 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:37:13,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:37:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:37:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:37:13,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:13,053 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:37:13,053 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:13,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:13,054 INFO L82 PathProgramCache]: Analyzing trace with hash -268904032, now seen corresponding path program 76 times [2019-08-05 10:37:13,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:13,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:37:13,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:15,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:15,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:37:15,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:37:15,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:37:15,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:37:15,249 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:37:15,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:15,347 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:37:15,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:37:15,347 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:37:15,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:15,348 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:37:15,348 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:37:15,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:37:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:37:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:37:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:37:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:37:15,352 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:37:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:15,352 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:37:15,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:37:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:37:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:37:15,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:15,353 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:37:15,353 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:15,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:15,353 INFO L82 PathProgramCache]: Analyzing trace with hash 253907654, now seen corresponding path program 77 times [2019-08-05 10:37:15,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:15,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:37:15,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:17,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:17,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:37:17,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:37:17,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:37:17,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:37:17,675 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:37:18,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:18,034 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:37:18,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:37:18,035 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:37:18,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:18,035 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:37:18,036 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:37:18,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:37:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:37:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:37:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:37:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:37:18,038 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:37:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:18,039 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:37:18,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:37:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:37:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:37:18,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:18,039 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:37:18,039 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:18,040 INFO L82 PathProgramCache]: Analyzing trace with hash -718799264, now seen corresponding path program 78 times [2019-08-05 10:37:18,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:18,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:37:18,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:20,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:20,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:37:20,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:37:20,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:37:20,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:37:20,433 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:37:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:20,630 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:37:20,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:37:20,630 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:37:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:20,631 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:37:20,631 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:37:20,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:37:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:37:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:37:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:37:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:37:20,634 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:37:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:20,635 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:37:20,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:37:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:37:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:37:20,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:20,636 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:37:20,636 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:20,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:20,636 INFO L82 PathProgramCache]: Analyzing trace with hash -807942650, now seen corresponding path program 79 times [2019-08-05 10:37:20,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:20,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:37:20,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:22,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:22,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:37:22,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:37:22,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:37:22,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:37:22,904 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:37:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:23,012 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:37:23,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:37:23,013 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:37:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:23,014 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:37:23,014 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:37:23,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:37:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:37:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:37:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:37:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:37:23,017 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:37:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:23,017 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:37:23,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:37:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:37:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:37:23,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:23,018 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:37:23,018 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:23,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:23,019 INFO L82 PathProgramCache]: Analyzing trace with hash 723579680, now seen corresponding path program 80 times [2019-08-05 10:37:23,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:23,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:37:23,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:27,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:27,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:37:27,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:37:27,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:37:27,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:37:27,371 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:37:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:27,477 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:37:27,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:37:27,478 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:37:27,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:27,479 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:37:27,479 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:37:27,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:37:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:37:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:37:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:37:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:37:27,482 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:37:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:27,482 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:37:27,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:37:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:37:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:37:27,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:27,483 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:37:27,483 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:27,484 INFO L82 PathProgramCache]: Analyzing trace with hash 956131654, now seen corresponding path program 81 times [2019-08-05 10:37:27,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:27,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:37:27,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:29,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:29,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:37:29,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:37:29,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:37:29,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:37:29,935 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:37:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:30,195 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:37:30,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:37:30,195 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:37:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:30,196 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:37:30,196 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:37:30,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:37:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:37:30,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:37:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:37:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:37:30,199 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:37:30,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:30,199 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:37:30,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:37:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:37:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:37:30,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:30,200 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:37:30,200 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:30,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:30,200 INFO L82 PathProgramCache]: Analyzing trace with hash -424691744, now seen corresponding path program 82 times [2019-08-05 10:37:30,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:30,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:37:30,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:32,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:32,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:37:32,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:37:32,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:37:32,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:37:32,694 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:37:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:32,802 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:37:32,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:37:32,802 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:37:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:32,803 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:37:32,803 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:37:32,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:37:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:37:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:37:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:37:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:37:32,806 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:37:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:32,806 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:37:32,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:37:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:37:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:37:32,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:32,807 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:37:32,807 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:32,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:32,808 INFO L82 PathProgramCache]: Analyzing trace with hash -280544122, now seen corresponding path program 83 times [2019-08-05 10:37:32,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:32,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:37:32,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:35,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:35,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:37:35,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:37:35,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:37:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:37:35,461 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:37:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:35,696 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:37:35,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:37:35,697 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:37:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:35,698 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:37:35,698 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:37:35,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:37:35,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:37:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:37:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:37:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:37:35,701 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:37:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:35,701 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:37:35,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:37:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:37:35,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:37:35,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:35,702 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:37:35,702 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:35,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:35,703 INFO L82 PathProgramCache]: Analyzing trace with hash -106935136, now seen corresponding path program 84 times [2019-08-05 10:37:35,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:35,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:37:35,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:38,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:38,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:37:38,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:37:38,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:37:38,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:37:38,261 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:37:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:38,378 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:37:38,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:37:38,378 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:37:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:38,379 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:37:38,379 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:37:38,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:37:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:37:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:37:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:37:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:37:38,382 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:37:38,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:38,383 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:37:38,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:37:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:37:38,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:37:38,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:38,384 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:37:38,384 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:38,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:38,384 INFO L82 PathProgramCache]: Analyzing trace with hash 979976134, now seen corresponding path program 85 times [2019-08-05 10:37:38,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:38,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:37:38,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:41,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:41,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:37:41,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:37:41,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:37:41,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:37:41,257 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:37:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:41,449 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:37:41,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:37:41,449 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:37:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:41,450 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:37:41,450 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:37:41,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:37:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:37:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:37:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:37:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:37:41,454 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:37:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:41,455 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:37:41,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:37:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:37:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:37:41,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:41,456 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:37:41,456 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:41,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:41,456 INFO L82 PathProgramCache]: Analyzing trace with hash 314487136, now seen corresponding path program 86 times [2019-08-05 10:37:41,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:41,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:37:41,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:44,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:44,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:37:44,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:37:44,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:37:44,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:37:44,153 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:37:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:44,282 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:37:44,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:37:44,282 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:37:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:44,283 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:37:44,283 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:37:44,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:37:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:37:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:37:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:37:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:37:44,286 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:37:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:44,286 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:37:44,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:37:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:37:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:37:44,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:44,287 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:37:44,287 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:44,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:44,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164678, now seen corresponding path program 87 times [2019-08-05 10:37:44,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:44,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:37:44,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:47,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:47,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:37:47,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:37:47,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:37:47,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:37:47,218 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:37:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:47,328 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:37:47,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:37:47,328 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:37:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:47,329 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:37:47,329 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:37:47,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:37:47,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:37:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:37:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:37:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:37:47,332 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:37:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:47,332 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:37:47,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:37:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:37:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:37:47,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:47,333 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:37:47,334 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:47,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364704, now seen corresponding path program 88 times [2019-08-05 10:37:47,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:47,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:37:47,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:50,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:50,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:37:50,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:37:50,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:37:50,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:37:50,097 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:37:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:50,307 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:37:50,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:37:50,307 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:37:50,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:50,308 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:37:50,308 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:37:50,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:37:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:37:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:37:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:37:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:37:50,310 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:37:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:50,310 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:37:50,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:37:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:37:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:37:50,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:50,311 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:37:50,311 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663622, now seen corresponding path program 89 times [2019-08-05 10:37:50,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:50,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:37:50,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:53,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:53,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:37:53,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:37:53,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:37:53,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:37:53,152 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:37:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:54,346 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:37:54,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:37:54,346 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:37:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:54,347 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:37:54,347 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:37:54,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:37:54,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:37:54,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:37:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:37:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:37:54,350 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:37:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:54,350 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:37:54,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:37:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:37:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:37:54,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:54,351 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:37:54,351 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:54,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:54,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930080, now seen corresponding path program 90 times [2019-08-05 10:37:54,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:54,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:37:54,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:57,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:57,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:37:57,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:37:57,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:37:57,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:37:57,415 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:37:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:57,526 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:37:57,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:37:57,527 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:37:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:57,527 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:37:57,527 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:37:57,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:37:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:37:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:37:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:37:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:37:57,530 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:37:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:57,530 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:37:57,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:37:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:37:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:37:57,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:57,531 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:37:57,532 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:57,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:57,532 INFO L82 PathProgramCache]: Analyzing trace with hash 854092166, now seen corresponding path program 91 times [2019-08-05 10:37:57,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:57,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:37:57,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:00,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:00,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:38:00,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:38:00,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:38:00,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:38:00,725 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:38:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:00,840 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:38:00,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:38:00,841 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:38:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:00,842 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:38:00,842 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:38:00,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:38:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:38:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:38:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:38:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:38:00,845 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:38:00,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:00,845 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:38:00,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:38:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:38:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:38:00,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:00,846 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:38:00,846 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:00,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:00,846 INFO L82 PathProgramCache]: Analyzing trace with hash 707051424, now seen corresponding path program 92 times [2019-08-05 10:38:00,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:00,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:38:00,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:05,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:05,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:38:05,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:38:05,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:38:05,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:38:05,035 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:38:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:05,164 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:38:05,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:38:05,164 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:38:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:05,165 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:38:05,165 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:38:05,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:38:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:38:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:38:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:38:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:38:05,168 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:38:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:05,168 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:38:05,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:38:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:38:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:38:05,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:05,169 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:38:05,170 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:05,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:05,170 INFO L82 PathProgramCache]: Analyzing trace with hash 443755718, now seen corresponding path program 93 times [2019-08-05 10:38:05,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:05,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:38:05,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:08,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:08,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:08,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:38:08,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:38:08,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:38:08,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:38:08,580 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:38:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:08,700 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:38:08,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:38:08,701 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:38:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:08,702 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:38:08,702 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:38:08,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:38:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:38:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:38:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:38:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:38:08,705 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:38:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:08,705 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:38:08,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:38:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:38:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:38:08,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:08,706 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:38:08,706 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:08,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:08,706 INFO L82 PathProgramCache]: Analyzing trace with hash 871523424, now seen corresponding path program 94 times [2019-08-05 10:38:08,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:08,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:38:08,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:12,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:12,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:38:12,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:38:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:38:12,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:38:12,542 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:38:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:12,673 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:38:12,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:38:12,674 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:38:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:12,675 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:38:12,675 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:38:12,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:38:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:38:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:38:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:38:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:38:12,677 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:38:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:12,677 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:38:12,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:38:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:38:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:38:12,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:12,678 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:38:12,678 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:12,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420422, now seen corresponding path program 95 times [2019-08-05 10:38:12,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:12,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:38:12,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:16,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:16,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:38:16,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:38:16,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:38:16,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:38:16,082 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:38:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:16,208 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:38:16,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:38:16,208 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:38:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:16,209 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:38:16,209 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:38:16,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:38:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:38:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:38:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:38:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:38:16,212 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:38:16,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:16,212 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:38:16,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:38:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:38:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:38:16,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:16,213 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:38:16,214 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:16,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:16,214 INFO L82 PathProgramCache]: Analyzing trace with hash 15325472, now seen corresponding path program 96 times [2019-08-05 10:38:16,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:16,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:38:16,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:19,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:19,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:38:19,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:38:19,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:38:19,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:38:19,454 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:38:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:19,599 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:38:19,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:38:19,600 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:38:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:19,600 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:38:19,601 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:38:19,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:38:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:38:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:38:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:38:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:38:19,604 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:38:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:19,604 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:38:19,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:38:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:38:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:38:19,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:19,605 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:38:19,605 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:19,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:19,606 INFO L82 PathProgramCache]: Analyzing trace with hash 475087686, now seen corresponding path program 97 times [2019-08-05 10:38:19,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:19,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:38:19,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:23,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:23,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:38:23,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:38:23,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:38:23,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:38:23,168 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:38:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:23,469 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:38:23,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:38:23,469 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:38:23,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:23,470 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:38:23,470 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:38:23,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:38:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:38:23,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:38:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:38:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:38:23,473 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:38:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:23,473 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:38:23,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:38:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:38:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:38:23,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:23,474 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:38:23,474 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814432, now seen corresponding path program 98 times [2019-08-05 10:38:23,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:23,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:38:23,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:27,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:27,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:38:27,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:38:27,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:38:27,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:38:27,104 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:38:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:27,236 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:38:27,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:38:27,237 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:38:27,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:27,238 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:38:27,238 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:38:27,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:38:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:38:27,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:38:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:38:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:38:27,241 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:38:27,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:27,241 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:38:27,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:38:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:38:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:38:27,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:27,242 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:38:27,242 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:27,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:27,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670598, now seen corresponding path program 99 times [2019-08-05 10:38:27,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:27,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:38:27,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:30,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:30,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:38:30,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:38:30,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:38:30,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:38:30,741 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:38:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:30,889 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:38:30,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:38:30,889 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:38:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:30,890 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:38:30,890 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:38:30,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:38:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:38:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:38:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:38:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:38:30,893 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:38:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:30,894 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:38:30,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:38:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:38:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:38:30,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:30,895 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:38:30,895 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:30,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:30,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080928, now seen corresponding path program 100 times [2019-08-05 10:38:30,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:30,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:38:30,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:34,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:34,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:38:34,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:38:34,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:38:34,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:38:34,560 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 10:38:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:34,698 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:38:34,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:38:34,698 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 10:38:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:34,699 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:38:34,699 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:38:34,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:38:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:38:34,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:38:34,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:38:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:38:34,702 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:38:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:34,703 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:38:34,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:38:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:38:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:38:34,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:34,704 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 10:38:34,704 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:34,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833862, now seen corresponding path program 101 times [2019-08-05 10:38:34,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:34,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:38:34,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:38,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:38,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:38:38,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:38:38,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:38:38,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:38:38,635 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 10:38:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:38,792 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:38:38,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:38:38,793 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 10:38:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:38,794 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:38:38,794 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:38:38,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:38:38,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:38:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:38:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:38:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:38:38,797 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 10:38:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:38,798 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:38:38,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:38:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:38:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:38:38,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:38,799 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 10:38:38,799 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:38,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:38,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076704, now seen corresponding path program 102 times [2019-08-05 10:38:38,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:38,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:38:38,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:42,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:42,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:38:42,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:38:42,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:38:42,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:38:42,904 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 10:38:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:43,111 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:38:43,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:38:43,112 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 10:38:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:43,113 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:38:43,113 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:38:43,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:38:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:38:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:38:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:38:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:38:43,116 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 10:38:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:43,117 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:38:43,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:38:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:38:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:38:43,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:43,118 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 10:38:43,118 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash 748670214, now seen corresponding path program 103 times [2019-08-05 10:38:43,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:43,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:38:43,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:47,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:47,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:38:47,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:38:47,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:38:47,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:38:47,156 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 10:38:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:47,342 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:38:47,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:38:47,343 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 10:38:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:47,343 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:38:47,344 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:38:47,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:38:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:38:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:38:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:38:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:38:47,347 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 10:38:47,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:47,347 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:38:47,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:38:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:38:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:38:47,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:47,347 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:38:47,348 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:47,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:47,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938208, now seen corresponding path program 104 times [2019-08-05 10:38:47,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:47,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:38:47,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:51,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:51,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:38:51,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:38:51,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:38:51,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:38:51,854 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:38:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:52,078 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:38:52,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:38:52,078 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:38:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:52,079 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:38:52,079 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:38:52,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:38:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:38:52,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:38:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:38:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:38:52,082 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 10:38:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:52,083 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:38:52,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:38:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:38:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:38:52,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:52,084 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:38:52,084 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:52,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:52,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492346, now seen corresponding path program 105 times [2019-08-05 10:38:52,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:52,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:38:52,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:55,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:55,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:38:55,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:38:55,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:38:55,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:38:55,914 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:38:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:56,070 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:38:56,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:38:56,070 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:38:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:56,071 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:38:56,071 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:38:56,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:38:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:38:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:38:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:38:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:38:56,074 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 10:38:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:56,074 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:38:56,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:38:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:38:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:38:56,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:56,076 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 10:38:56,076 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:56,076 INFO L82 PathProgramCache]: Analyzing trace with hash -132755232, now seen corresponding path program 106 times [2019-08-05 10:38:56,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:56,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:38:56,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:00,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:00,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:39:00,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:39:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:39:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:39:00,256 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 10:39:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:00,426 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:39:00,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:39:00,426 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 10:39:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:00,426 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:39:00,427 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:39:00,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:39:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:39:00,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:39:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:39:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:39:00,430 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 10:39:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:00,430 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:39:00,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:39:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:39:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:39:00,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:00,431 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 10:39:00,431 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash 179553158, now seen corresponding path program 107 times [2019-08-05 10:39:00,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:00,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:39:00,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:04,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:04,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:39:04,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:39:04,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:39:04,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:39:04,651 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 10:39:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:04,816 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:39:04,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:39:04,817 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 10:39:04,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:04,817 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:39:04,818 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:39:04,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:39:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:39:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:39:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:39:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:39:04,819 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 10:39:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:04,820 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:39:04,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:39:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:39:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:39:04,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:04,820 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 10:39:04,820 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178656, now seen corresponding path program 108 times [2019-08-05 10:39:04,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:04,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:39:04,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:09,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:09,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:39:09,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:39:09,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:39:09,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:39:09,214 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 10:39:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:09,368 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:39:09,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:39:09,368 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 10:39:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:09,369 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:39:09,369 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:39:09,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:39:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:39:09,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:39:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:39:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:39:09,372 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 10:39:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:09,372 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:39:09,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:39:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:39:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:39:09,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:09,373 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 10:39:09,374 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash 751830726, now seen corresponding path program 109 times [2019-08-05 10:39:09,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:09,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:39:09,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:13,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:13,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:39:13,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:39:13,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:39:13,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:39:13,777 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 10:39:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:13,979 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:39:13,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:39:13,980 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 10:39:13,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:13,980 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:39:13,980 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:39:13,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:39:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:39:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:39:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:39:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:39:13,983 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 10:39:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:13,984 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:39:13,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:39:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:39:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:39:13,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:13,984 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 10:39:13,984 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914080, now seen corresponding path program 110 times [2019-08-05 10:39:13,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:14,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:39:14,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:18,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:18,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:39:18,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:39:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:39:18,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:39:18,430 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-05 10:39:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:18,594 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:39:18,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:39:18,594 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 10:39:18,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:18,595 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:39:18,595 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:39:18,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:39:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:39:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:39:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:39:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:39:18,599 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 10:39:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:18,599 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:39:18,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:39:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:39:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:39:18,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:18,600 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 10:39:18,600 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:18,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:18,601 INFO L82 PathProgramCache]: Analyzing trace with hash 954759686, now seen corresponding path program 111 times [2019-08-05 10:39:18,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:18,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:39:18,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:23,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:23,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:39:23,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:39:23,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:39:23,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:39:23,090 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-05 10:39:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:23,273 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:39:23,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:39:23,273 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 10:39:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:23,274 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:39:23,274 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:39:23,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:39:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:39:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:39:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:39:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:39:23,278 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 10:39:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:23,278 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:39:23,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:39:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:39:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:39:23,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:23,279 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:39:23,279 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:23,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:23,279 INFO L82 PathProgramCache]: Analyzing trace with hash -467222752, now seen corresponding path program 112 times [2019-08-05 10:39:23,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:23,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:39:23,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:27,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:27,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:39:27,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:39:27,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:39:27,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:39:27,865 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:39:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:28,074 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:39:28,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:39:28,074 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:39:28,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:28,075 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:39:28,075 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:39:28,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:39:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:39:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:39:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:39:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:39:28,077 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 10:39:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:28,077 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:39:28,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:39:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:39:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:39:28,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:28,078 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 10:39:28,078 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:28,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:28,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005370, now seen corresponding path program 113 times [2019-08-05 10:39:28,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:28,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:39:28,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:32,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:32,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:39:32,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:39:32,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:39:32,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:39:32,753 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 10:39:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:32,967 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:39:32,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:39:32,968 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 10:39:32,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:32,969 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:39:32,969 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:39:32,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:39:32,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:39:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:39:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:39:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:39:32,972 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 10:39:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:32,972 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:39:32,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:39:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:39:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:39:32,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:32,973 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-05 10:39:32,973 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:32,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:32,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439136, now seen corresponding path program 114 times [2019-08-05 10:39:32,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:32,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:39:32,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:37,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:37,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 10:39:37,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 10:39:37,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 10:39:37,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:39:37,448 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-05 10:39:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:37,672 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:39:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:39:37,672 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-05 10:39:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:37,672 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:39:37,672 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:39:37,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:39:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:39:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:39:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:39:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:39:37,675 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 10:39:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:37,675 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:39:37,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 10:39:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:39:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:39:37,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:37,676 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-05 10:39:37,677 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:37,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:37,677 INFO L82 PathProgramCache]: Analyzing trace with hash 954069126, now seen corresponding path program 115 times [2019-08-05 10:39:37,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:37,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:39:37,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:42,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:42,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 10:39:42,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 10:39:42,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 10:39:42,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:39:42,189 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2019-08-05 10:39:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:42,400 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:39:42,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 10:39:42,400 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-05 10:39:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:42,400 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:39:42,401 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:39:42,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:39:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:39:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:39:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:39:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:39:42,404 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 10:39:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:42,404 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:39:42,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 10:39:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:39:42,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:39:42,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:42,405 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-05 10:39:42,405 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash -488630112, now seen corresponding path program 116 times [2019-08-05 10:39:42,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:42,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:39:42,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:47,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:47,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 10:39:47,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 10:39:47,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 10:39:47,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:39:47,308 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2019-08-05 10:39:47,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:47,542 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:39:47,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 10:39:47,542 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2019-08-05 10:39:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:47,543 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:39:47,543 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:39:47,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:39:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:39:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:39:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:39:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:39:47,546 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-05 10:39:47,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:47,547 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:39:47,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 10:39:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:39:47,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:39:47,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:47,548 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2019-08-05 10:39:47,548 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:47,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:47,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333766, now seen corresponding path program 117 times [2019-08-05 10:39:47,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:47,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:39:47,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:52,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:52,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-08-05 10:39:52,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-08-05 10:39:52,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-08-05 10:39:52,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:39:52,566 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2019-08-05 10:39:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:52,782 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:39:52,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-08-05 10:39:52,782 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2019-08-05 10:39:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:52,783 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:39:52,783 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:39:52,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:39:52,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:39:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 10:39:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:39:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 10:39:52,785 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-08-05 10:39:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:52,785 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 10:39:52,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-08-05 10:39:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 10:39:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:39:52,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:52,786 INFO L399 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2019-08-05 10:39:52,786 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164640, now seen corresponding path program 118 times [2019-08-05 10:39:52,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:52,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:39:52,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:39:54,323 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:39:54,323 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:39:54,327 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:39:54,327 INFO L202 PluginConnector]: Adding new model codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:39:54 BoogieIcfgContainer [2019-08-05 10:39:54,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:39:54,330 INFO L168 Benchmark]: Toolchain (without parser) took 239185.64 ms. Allocated memory was 133.7 MB in the beginning and 703.6 MB in the end (delta: 569.9 MB). Free memory was 111.3 MB in the beginning and 89.2 MB in the end (delta: 22.1 MB). Peak memory consumption was 592.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:54,330 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 112.5 MB in the beginning and 112.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:39:54,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.87 ms. Allocated memory is still 133.7 MB. Free memory was 111.3 MB in the beginning and 109.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:54,331 INFO L168 Benchmark]: Boogie Preprocessor took 21.68 ms. Allocated memory is still 133.7 MB. Free memory was 109.4 MB in the beginning and 108.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:54,332 INFO L168 Benchmark]: RCFGBuilder took 305.64 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 98.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:54,332 INFO L168 Benchmark]: TraceAbstraction took 238814.77 ms. Allocated memory was 133.7 MB in the beginning and 703.6 MB in the end (delta: 569.9 MB). Free memory was 98.7 MB in the beginning and 89.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 579.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:54,335 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.21 ms. Allocated memory is still 133.7 MB. Free memory was 112.5 MB in the beginning and 112.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.87 ms. Allocated memory is still 133.7 MB. Free memory was 111.3 MB in the beginning and 109.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.68 ms. Allocated memory is still 133.7 MB. Free memory was 109.4 MB in the beginning and 108.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 305.64 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 98.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238814.77 ms. Allocated memory was 133.7 MB in the beginning and 703.6 MB in the end (delta: 569.9 MB). Free memory was 98.7 MB in the beginning and 89.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 579.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 118,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 238.7s OverallTime, 119 OverallIterations, 118 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 355 SDtfs, 0 SDslu, 1957 SDs, 0 SdLazy, 9095 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7139 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7021 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 218.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 118 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 220.6s InterpolantComputationTime, 7257 NumberOfCodeBlocks, 7257 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 7139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1692179 SizeOfPredicates, 118 NumberOfNonLiveVariables, 22007 ConjunctsInSsa, 7139 ConjunctsInUnsatCore, 118 InterpolantComputations, 1 PerfectInterpolantSequences, 0/273819 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown