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/INT_add_vs_inc.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:35:21,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:35:21,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:35:21,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:35:21,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:35:21,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:35:21,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:35:21,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:35:21,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:35:21,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:35:21,759 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:35:21,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:35:21,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:35:21,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:35:21,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:35:21,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:35:21,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:35:21,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:35:21,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:35:21,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:35:21,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:35:21,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:35:21,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:35:21,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:35:21,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:35:21,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:35:21,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:35:21,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:35:21,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:35:21,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:35:21,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:35:21,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:35:21,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:35:21,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:35:21,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:35:21,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:35:21,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:35:21,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:35:21,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:35:21,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:35:21,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:35:21,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:35:21,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:35:21,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:35:21,848 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:35:21,849 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:35:21,849 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/INT_add_vs_inc.bpl [2019-08-05 10:35:21,850 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/INT_add_vs_inc.bpl' [2019-08-05 10:35:21,882 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:35:21,883 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:35:21,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:35:21,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:35:21,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:35:21,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:21" (1/1) ... [2019-08-05 10:35:21,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:21" (1/1) ... [2019-08-05 10:35:21,916 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:35:21,916 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:35:21,916 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:35:21,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:35:21,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:35:21,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:35:21,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:35:21,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:21" (1/1) ... [2019-08-05 10:35:21,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:21" (1/1) ... [2019-08-05 10:35:21,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:21" (1/1) ... [2019-08-05 10:35:21,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:21" (1/1) ... [2019-08-05 10:35:21,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:21" (1/1) ... [2019-08-05 10:35:21,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:21" (1/1) ... [2019-08-05 10:35:21,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:21" (1/1) ... [2019-08-05 10:35:21,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:35:21,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:35:21,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:35:21,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:35:21,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:21" (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:22,013 INFO L124 BoogieDeclarations]: Specification and implementation of procedure add given in one single declaration [2019-08-05 10:35:22,014 INFO L130 BoogieDeclarations]: Found specification of procedure add [2019-08-05 10:35:22,014 INFO L138 BoogieDeclarations]: Found implementation of procedure add [2019-08-05 10:35:22,202 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:35:22,202 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:35:22,204 INFO L202 PluginConnector]: Adding new model INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:35:22 BoogieIcfgContainer [2019-08-05 10:35:22,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:35:22,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:35:22,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:35:22,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:35:22,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:21" (1/2) ... [2019-08-05 10:35:22,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c5fdfd and model type INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:35:22, skipping insertion in model container [2019-08-05 10:35:22,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:35:22" (2/2) ... [2019-08-05 10:35:22,212 INFO L109 eAbstractionObserver]: Analyzing ICFG INT_add_vs_inc.bpl [2019-08-05 10:35:22,221 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:35:22,228 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:35:22,244 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:35:22,267 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:35:22,268 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:35:22,268 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:35:22,269 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:35:22,269 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:35:22,269 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:35:22,269 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:35:22,269 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:35:22,269 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:35:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:35:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:35:22,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:22,293 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:35:22,296 INFO L418 AbstractCegarLoop]: === Iteration 1 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:22,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:22,302 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 10:35:22,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:22,398 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:35:22,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:22,639 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:22,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:35:22,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:35:22,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:35:22,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:35:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:35:22,660 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2019-08-05 10:35:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:22,843 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:35:22,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:35:22,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:35:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:22,857 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:35:22,857 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:35:22,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:35:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:35:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:35:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:35:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:35:22,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:35:22,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:22,893 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:35:22,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:35:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:35:22,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:35:22,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:22,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:35:22,895 INFO L418 AbstractCegarLoop]: === Iteration 2 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:22,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 10:35:22,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:22,907 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:35:22,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:23,175 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:35:23,176 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:23,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:23,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:35:23,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:35:23,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:35:23,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:35:23,180 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 10:35:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:23,399 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:35:23,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:35:23,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:35:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:23,400 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:35:23,400 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:35:23,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:35:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:35:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:35:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:35:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:35:23,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:35:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:23,404 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:35:23,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:35:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:35:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:35:23,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:23,405 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:35:23,406 INFO L418 AbstractCegarLoop]: === Iteration 3 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:23,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 10:35:23,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:23,420 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:35:23,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:23,663 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:35:23,722 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:23,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:23,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:35:23,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:35:23,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:35:23,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:35:23,724 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 10:35:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:23,799 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:35:23,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:35:23,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:35:23,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:23,801 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:35:23,802 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:35:23,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:35:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:35:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:35:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:35:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:35:23,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:35:23,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:23,806 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:35:23,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:35:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:35:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:35:23,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:23,806 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:35:23,807 INFO L418 AbstractCegarLoop]: === Iteration 4 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:23,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:23,807 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 10:35:23,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:23,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:35:23,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:24,045 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:24,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:24,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:35:24,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:35:24,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:35:24,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:35:24,047 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:35:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:24,137 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:35:24,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:35:24,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:35:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:24,138 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:35:24,138 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:35:24,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:35:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:35:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:35:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:35:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:35:24,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:35:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:24,143 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:35:24,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:35:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:35:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:35:24,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:24,144 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:35:24,144 INFO L418 AbstractCegarLoop]: === Iteration 5 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:24,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:24,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 10:35:24,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:24,161 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:35:24,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:24,331 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:24,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:24,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:35:24,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:35:24,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:35:24,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:35:24,334 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 10:35:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:24,711 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:35:24,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:35:24,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:35:24,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:24,714 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:35:24,714 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:35:24,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:35:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:35:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:35:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:35:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:35:24,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:35:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:24,717 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:35:24,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:35:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:35:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:35:24,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:24,718 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:35:24,718 INFO L418 AbstractCegarLoop]: === Iteration 6 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:24,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:24,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 10:35:24,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:24,737 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:35:24,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:24,919 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:24,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:24,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:35:24,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:35:24,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:35:24,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:35:24,921 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 10:35:25,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:25,021 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:35:25,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:35:25,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:35:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:25,029 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:35:25,029 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:35:25,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:35:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:35:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:35:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:35:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:35:25,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:35:25,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:25,035 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:35:25,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:35:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:35:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:35:25,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:25,036 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:35:25,036 INFO L418 AbstractCegarLoop]: === Iteration 7 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:25,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:25,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 10:35:25,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:25,080 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:35:25,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:25,256 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:25,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:25,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:35:25,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:35:25,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:35:25,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:35:25,258 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 10:35:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:25,387 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:35:25,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:35:25,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:35:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:25,389 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:35:25,389 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:35:25,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:35:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:35:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:35:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:35:25,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:35:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:25,392 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:35:25,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:35:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:35:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:35:25,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:25,393 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:35:25,393 INFO L418 AbstractCegarLoop]: === Iteration 8 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:25,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-05 10:35:25,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:25,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:35:25,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:25,712 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:25,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:25,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:35:25,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:35:25,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:35:25,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:25,714 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 10:35:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:25,824 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:35:25,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:35:25,824 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:35:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:25,825 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:35:25,825 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:35:25,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:35:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:35:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:35:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:35:25,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:35:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:25,830 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:35:25,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:35:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:35:25,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:35:25,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:25,831 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:35:25,831 INFO L418 AbstractCegarLoop]: === Iteration 9 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:25,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:25,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-05 10:35:25,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:25,850 WARN L254 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:35:25,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:26,035 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:26,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:26,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:35:26,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:35:26,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:35:26,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:26,037 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 10:35:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:26,202 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:35:26,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:35:26,203 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:35:26,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:26,204 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:35:26,204 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:35:26,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:35:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:35:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:35:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:35:26,207 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:35:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:26,207 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:35:26,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:35:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:35:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:35:26,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:26,208 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:35:26,208 INFO L418 AbstractCegarLoop]: === Iteration 10 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:26,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-05 10:35:26,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:26,228 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:35:26,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:26,411 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:26,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:26,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:35:26,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:35:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:35:26,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:26,414 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 10:35:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:26,585 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:35:26,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:35:26,585 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:35:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:26,586 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:35:26,587 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:35:26,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:35:26,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:35:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:35:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:35:26,590 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:35:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:26,590 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:35:26,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:35:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:35:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:35:26,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:26,591 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:35:26,592 INFO L418 AbstractCegarLoop]: === Iteration 11 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:26,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:26,592 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2019-08-05 10:35:26,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:26,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:35:26,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:27,077 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:27,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:27,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:35:27,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:35:27,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:35:27,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:27,080 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 10:35:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:27,404 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:35:27,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:35:27,405 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:35:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:27,406 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:35:27,406 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:35:27,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:35:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:35:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:35:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:35:27,410 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:35:27,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:27,411 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:35:27,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:35:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:35:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:35:27,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:27,411 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:35:27,412 INFO L418 AbstractCegarLoop]: === Iteration 12 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash 581150598, now seen corresponding path program 11 times [2019-08-05 10:35:27,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:27,432 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:35:27,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:27,638 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:27,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:27,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:35:27,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:35:27,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:35:27,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:27,640 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 10:35:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:27,841 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:35:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:35:27,842 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:35:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:27,843 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:35:27,843 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:35:27,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:35:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:35:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:35:27,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:35:27,848 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:35:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:27,848 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:35:27,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:35:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:35:27,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:35:27,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:27,849 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:35:27,850 INFO L418 AbstractCegarLoop]: === Iteration 13 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:27,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:27,850 INFO L82 PathProgramCache]: Analyzing trace with hash 835797408, now seen corresponding path program 12 times [2019-08-05 10:35:27,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:27,871 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:35:27,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:28,094 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:28,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:28,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:35:28,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:35:28,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:35:28,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:28,096 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 10:35:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:28,564 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:35:28,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:35:28,565 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:35:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:28,565 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:35:28,566 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:35:28,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:35:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:35:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:35:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:35:28,570 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:35:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:28,571 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:35:28,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:35:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:35:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:35:28,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:28,571 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:35:28,572 INFO L418 AbstractCegarLoop]: === Iteration 14 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:28,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:28,572 INFO L82 PathProgramCache]: Analyzing trace with hash 139913926, now seen corresponding path program 13 times [2019-08-05 10:35:28,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:28,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:35:28,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:29,252 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:29,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:29,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:35:29,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:35:29,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:35:29,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:29,254 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 10:35:29,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:29,471 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:35:29,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:35:29,472 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:35:29,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:29,472 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:35:29,472 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:35:29,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:35:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:35:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:35:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:35:29,476 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:35:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:29,476 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:35:29,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:35:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:35:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:35:29,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:29,477 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:35:29,478 INFO L418 AbstractCegarLoop]: === Iteration 15 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash 42362464, now seen corresponding path program 14 times [2019-08-05 10:35:29,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:29,495 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:35:29,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:29,817 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:29,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:29,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:35:29,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:35:29,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:35:29,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:29,819 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 10:35:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:30,107 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:35:30,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:35:30,108 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:35:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:30,109 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:35:30,109 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:35:30,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:35:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:35:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:35:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:35:30,113 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:35:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:30,114 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:35:30,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:35:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:35:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:35:30,114 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:30,115 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:35:30,115 INFO L418 AbstractCegarLoop]: === Iteration 16 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:30,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:30,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234438, now seen corresponding path program 15 times [2019-08-05 10:35:30,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:30,133 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:35:30,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:30,404 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:35:30,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:30,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:35:30,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:35:30,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:35:30,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:30,406 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 10:35:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:30,756 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:35:30,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:35:30,757 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:35:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:30,757 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:35:30,758 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:35:30,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:35:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:35:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:35:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:35:30,761 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:35:30,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:30,761 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:35:30,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:35:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:35:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:35:30,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:30,762 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:35:30,762 INFO L418 AbstractCegarLoop]: === Iteration 17 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:30,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559968, now seen corresponding path program 16 times [2019-08-05 10:35:30,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:30,780 WARN L254 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:35:30,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:31,433 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:35:31,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:31,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:35:31,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:35:31,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:35:31,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:31,435 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 10:35:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:31,781 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:35:31,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:35:31,782 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:35:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:31,783 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:35:31,783 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:35:31,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:35:31,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:35:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:35:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:35:31,787 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:35:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:31,787 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:35:31,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:35:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:35:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:35:31,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:31,788 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:35:31,788 INFO L418 AbstractCegarLoop]: === Iteration 18 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:31,788 INFO L82 PathProgramCache]: Analyzing trace with hash -702152378, now seen corresponding path program 17 times [2019-08-05 10:35:31,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:31,806 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:35:31,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:32,338 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:35:32,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:32,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:35:32,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:35:32,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:35:32,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:32,340 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 10:35:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:32,733 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:35:32,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:35:32,734 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:35:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:32,735 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:35:32,735 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:35:32,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:35:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:35:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:35:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:35:32,740 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:35:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:32,740 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:35:32,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:35:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:35:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:35:32,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:32,742 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:35:32,742 INFO L418 AbstractCegarLoop]: === Iteration 19 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:32,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:32,742 INFO L82 PathProgramCache]: Analyzing trace with hash -291889184, now seen corresponding path program 18 times [2019-08-05 10:35:32,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:32,759 WARN L254 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:35:32,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:33,310 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:35:33,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:33,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:35:33,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:35:33,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:35:33,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:33,312 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 10:35:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:33,710 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:35:33,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:35:33,711 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:35:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:33,712 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:35:33,712 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:35:33,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:35:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:35:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:35:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:35:33,716 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:35:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:33,716 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:35:33,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:35:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:35:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:35:33,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:33,717 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:35:33,718 INFO L418 AbstractCegarLoop]: === Iteration 20 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash -458632058, now seen corresponding path program 19 times [2019-08-05 10:35:33,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:33,732 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:35:33,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:34,239 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:35:34,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:34,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:35:34,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:35:34,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:35:34,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:34,242 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-05 10:35:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:34,694 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:35:34,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:35:34,694 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:35:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:34,695 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:35:34,695 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:35:34,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:35:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:35:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:35:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:35:34,699 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:35:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:34,699 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:35:34,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:35:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:35:34,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:35:34,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:34,700 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:35:34,701 INFO L418 AbstractCegarLoop]: === Iteration 21 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:34,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693856, now seen corresponding path program 20 times [2019-08-05 10:35:34,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:34,716 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:35:34,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:35,196 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:35:35,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:35,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:35:35,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:35:35,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:35:35,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:35,198 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-05 10:35:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:35,639 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:35:35,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:35:35,639 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:35:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:35,640 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:35:35,640 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:35:35,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:35:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:35:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:35:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:35:35,644 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:35:35,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:35,644 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:35:35,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:35:35,644 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:35:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:35:35,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:35,645 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:35:35,645 INFO L418 AbstractCegarLoop]: === Iteration 22 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:35,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:35,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161478, now seen corresponding path program 21 times [2019-08-05 10:35:35,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:35,661 WARN L254 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:35:35,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:36,219 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:35:36,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:36,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:35:36,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:35:36,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:35:36,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:36,221 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-05 10:35:37,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:37,545 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:35:37,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:35:37,548 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:35:37,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:37,548 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:35:37,549 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:35:37,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:37,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:35:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:35:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:35:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:35:37,552 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:35:37,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:37,552 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:35:37,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:35:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:35:37,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:35:37,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:37,553 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:35:37,553 INFO L418 AbstractCegarLoop]: === Iteration 23 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:37,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:37,553 INFO L82 PathProgramCache]: Analyzing trace with hash -818603680, now seen corresponding path program 22 times [2019-08-05 10:35:37,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:37,567 WARN L254 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:35:37,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:38,175 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:35:38,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:38,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:35:38,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:35:38,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:35:38,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:38,176 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-05 10:35:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:38,755 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:35:38,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:35:38,756 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:35:38,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:38,756 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:35:38,756 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:35:38,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:35:38,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:35:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:35:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:35:38,760 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:35:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:38,761 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:35:38,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:35:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:35:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:35:38,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:38,761 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:35:38,762 INFO L418 AbstractCegarLoop]: === Iteration 24 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:38,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:38,762 INFO L82 PathProgramCache]: Analyzing trace with hash 393087750, now seen corresponding path program 23 times [2019-08-05 10:35:38,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:38,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:35:38,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:39,466 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:35:39,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:39,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:35:39,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:35:39,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:35:39,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:39,468 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-05 10:35:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:40,110 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:35:40,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:35:40,111 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:35:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:40,112 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:35:40,112 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:35:40,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:35:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:35:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:35:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:35:40,116 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:35:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:40,116 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:35:40,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:35:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:35:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:35:40,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:40,117 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:35:40,118 INFO L418 AbstractCegarLoop]: === Iteration 25 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:40,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:40,118 INFO L82 PathProgramCache]: Analyzing trace with hash -699183584, now seen corresponding path program 24 times [2019-08-05 10:35:40,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:40,134 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:35:40,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:40,611 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:35:40,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:40,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:35:40,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:35:40,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:35:40,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:40,613 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-05 10:35:41,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:41,211 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:35:41,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:35:41,212 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 10:35:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:41,212 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:35:41,213 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:35:41,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:35:41,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:35:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:35:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:35:41,216 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:35:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:41,217 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:35:41,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:35:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:35:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:35:41,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:41,218 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:35:41,218 INFO L418 AbstractCegarLoop]: === Iteration 26 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:41,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:41,218 INFO L82 PathProgramCache]: Analyzing trace with hash -199856570, now seen corresponding path program 25 times [2019-08-05 10:35:41,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:41,234 WARN L254 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:35:41,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:42,106 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:35:42,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:42,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:35:42,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:35:42,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:35:42,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:42,109 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-05 10:35:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:42,869 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:35:42,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:35:42,870 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 10:35:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:42,871 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:35:42,871 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:35:42,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:35:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:35:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:35:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:35:42,874 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:35:42,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:42,874 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:35:42,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:35:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:35:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:35:42,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:42,875 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:35:42,875 INFO L418 AbstractCegarLoop]: === Iteration 27 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:42,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588320, now seen corresponding path program 26 times [2019-08-05 10:35:42,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:42,892 WARN L254 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:35:42,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:44,324 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:35:44,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:44,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:35:44,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:35:44,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:35:44,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:44,326 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-05 10:35:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:45,002 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:35:45,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:35:45,002 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 10:35:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:45,003 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:35:45,003 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:35:45,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:45,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:35:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:35:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:35:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:35:45,007 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:35:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:45,007 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:35:45,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:35:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:35:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:35:45,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:45,008 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:35:45,008 INFO L418 AbstractCegarLoop]: === Iteration 28 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:45,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:45,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302278, now seen corresponding path program 27 times [2019-08-05 10:35:45,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:45,026 WARN L254 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:35:45,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:47,010 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:35:47,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:47,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:35:47,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:35:47,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:35:47,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:47,011 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-05 10:35:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:47,890 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:35:47,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:35:47,890 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:35:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:47,891 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:35:47,891 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:35:47,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:35:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:35:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:35:47,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:35:47,896 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:35:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:47,897 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:35:47,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:35:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:35:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:35:47,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:47,897 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:35:47,898 INFO L418 AbstractCegarLoop]: === Iteration 29 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:47,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:47,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336992, now seen corresponding path program 28 times [2019-08-05 10:35:47,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:47,915 WARN L254 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:35:47,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:48,647 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:35:48,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:48,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:35:48,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:35:48,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:35:48,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:48,649 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-05 10:35:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:49,409 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:35:49,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:35:49,409 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 10:35:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:49,410 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:35:49,410 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:35:49,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:35:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:35:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:35:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:35:49,414 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:35:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:49,414 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:35:49,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:35:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:35:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:35:49,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:49,415 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:35:49,415 INFO L418 AbstractCegarLoop]: === Iteration 30 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:49,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash 125289670, now seen corresponding path program 29 times [2019-08-05 10:35:49,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:49,432 WARN L254 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:35:49,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:50,133 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:35:50,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:50,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:35:50,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:35:50,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:35:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:50,135 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-05 10:35:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:50,945 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:35:50,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:35:50,945 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 10:35:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:50,946 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:35:50,946 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:35:50,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:35:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:35:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:35:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:35:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:35:50,950 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:35:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:50,950 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:35:50,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:35:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:35:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:35:50,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:50,951 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:35:50,951 INFO L418 AbstractCegarLoop]: === Iteration 31 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:50,951 INFO L82 PathProgramCache]: Analyzing trace with hash -410989472, now seen corresponding path program 30 times [2019-08-05 10:35:50,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:50,968 WARN L254 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:35:50,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:51,867 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:35:51,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:51,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:35:51,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:35:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:35:51,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:35:51,869 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-05 10:35:52,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:52,907 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:35:52,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:35:52,908 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 10:35:52,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:52,909 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:35:52,909 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:35:52,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:35:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:35:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:35:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:35:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:35:52,912 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:35:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:52,913 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:35:52,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:35:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:35:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:35:52,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:52,913 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:35:52,914 INFO L418 AbstractCegarLoop]: === Iteration 32 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:52,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:52,914 INFO L82 PathProgramCache]: Analyzing trace with hash 144226310, now seen corresponding path program 31 times [2019-08-05 10:35:52,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:52,931 WARN L254 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:35:52,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:53,785 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:35:53,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:53,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:35:53,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:35:53,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:35:53,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:35:53,787 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-05 10:35:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:54,705 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:35:54,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:35:54,705 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 10:35:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:54,706 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:35:54,706 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:35:54,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:35:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:35:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:35:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:35:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:35:54,711 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:35:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:54,712 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:35:54,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:35:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:35:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:35:54,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:54,713 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:35:54,713 INFO L418 AbstractCegarLoop]: === Iteration 33 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:54,713 INFO L82 PathProgramCache]: Analyzing trace with hash 176046368, now seen corresponding path program 32 times [2019-08-05 10:35:54,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:54,733 WARN L254 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:35:54,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:55,458 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:35:55,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:55,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:35:55,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:35:55,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:35:55,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:35:55,460 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-05 10:35:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:56,414 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:35:56,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:35:56,415 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 10:35:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:56,415 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:35:56,416 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:35:56,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:35:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:35:56,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:35:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:35:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:35:56,420 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:35:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:56,420 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:35:56,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:35:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:35:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:35:56,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:56,421 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:35:56,421 INFO L418 AbstractCegarLoop]: === Iteration 34 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468166, now seen corresponding path program 33 times [2019-08-05 10:35:56,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:56,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:35:56,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:57,876 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:35:57,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:57,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:35:57,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:35:57,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:35:57,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:35:57,877 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-05 10:35:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:58,918 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:35:58,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:35:58,919 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 10:35:58,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:58,919 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:35:58,920 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:35:58,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:35:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:35:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:35:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:35:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:35:58,923 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:35:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:58,923 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:35:58,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:35:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:35:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:35:58,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:58,924 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:35:58,924 INFO L418 AbstractCegarLoop]: === Iteration 35 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:58,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:58,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772832, now seen corresponding path program 34 times [2019-08-05 10:35:58,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:58,943 WARN L254 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:35:58,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:00,011 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:00,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:00,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:36:00,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:36:00,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:36:00,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:00,013 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-05 10:36:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:01,087 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:36:01,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:36:01,088 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 10:36:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:01,089 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:36:01,089 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:36:01,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:36:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:36:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:36:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:36:01,092 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:36:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:01,093 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:36:01,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:36:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:36:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:36:01,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:01,094 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:36:01,094 INFO L418 AbstractCegarLoop]: === Iteration 36 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:01,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:01,094 INFO L82 PathProgramCache]: Analyzing trace with hash 440348294, now seen corresponding path program 35 times [2019-08-05 10:36:01,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:01,112 WARN L254 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:36:01,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:02,079 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:02,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:02,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:36:02,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:36:02,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:36:02,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:02,081 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-05 10:36:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:03,328 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:36:03,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:36:03,329 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:36:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:03,330 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:36:03,330 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:36:03,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:36:03,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:36:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:36:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:36:03,333 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:36:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:03,333 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:36:03,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:36:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:36:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:36:03,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:03,334 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:36:03,335 INFO L418 AbstractCegarLoop]: === Iteration 37 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:03,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash 765893280, now seen corresponding path program 36 times [2019-08-05 10:36:03,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:03,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:36:03,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:04,279 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:04,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:04,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:36:04,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:36:04,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:36:04,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:04,281 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-05 10:36:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:05,471 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:36:05,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:36:05,472 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 10:36:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:05,473 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:36:05,473 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:36:05,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1559, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:36:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:36:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:36:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:36:05,477 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:36:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:05,477 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:36:05,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:36:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:36:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:36:05,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:05,478 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:36:05,478 INFO L418 AbstractCegarLoop]: === Iteration 38 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114042, now seen corresponding path program 37 times [2019-08-05 10:36:05,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:05,496 WARN L254 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:36:05,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:06,440 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:06,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:06,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:36:06,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:36:06,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:36:06,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:06,442 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-05 10:36:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:07,742 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:36:07,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:36:07,742 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 10:36:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:07,743 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:36:07,743 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:36:07,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:36:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:36:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:36:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:36:07,745 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:36:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:07,745 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:36:07,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:36:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:36:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:36:07,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:07,746 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:36:07,746 INFO L418 AbstractCegarLoop]: === Iteration 39 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:07,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972192, now seen corresponding path program 38 times [2019-08-05 10:36:07,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:07,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:36:07,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:08,991 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:08,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:08,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:36:08,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:36:08,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:36:08,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:08,993 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-05 10:36:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:10,299 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:36:10,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:36:10,301 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 10:36:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:10,301 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:36:10,301 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:36:10,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:36:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:36:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:36:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:36:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:36:10,304 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:36:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:10,305 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:36:10,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:36:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:36:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:36:10,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:10,305 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:36:10,306 INFO L418 AbstractCegarLoop]: === Iteration 40 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:10,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495750, now seen corresponding path program 39 times [2019-08-05 10:36:10,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:10,323 WARN L254 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:36:10,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:11,299 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:11,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:11,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:36:11,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:36:11,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:36:11,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:36:11,300 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-05 10:36:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:12,694 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:36:12,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:36:12,695 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 10:36:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:12,695 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:36:12,695 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:36:12,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1805, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:36:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:36:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:36:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:36:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:36:12,699 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:36:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:12,699 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:36:12,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:36:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:36:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:36:12,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:12,700 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:36:12,700 INFO L418 AbstractCegarLoop]: === Iteration 41 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:12,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791456, now seen corresponding path program 40 times [2019-08-05 10:36:12,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:12,721 WARN L254 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:36:12,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:14,043 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:14,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:14,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:36:14,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:36:14,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:36:14,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:36:14,045 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-05 10:36:15,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:15,493 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:36:15,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:36:15,494 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 10:36:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:15,494 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:36:15,494 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:36:15,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:36:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:36:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:36:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:36:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:36:15,498 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:36:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:15,499 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:36:15,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:36:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:36:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:36:15,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:15,499 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:36:15,500 INFO L418 AbstractCegarLoop]: === Iteration 42 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:15,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:15,500 INFO L82 PathProgramCache]: Analyzing trace with hash -692041658, now seen corresponding path program 41 times [2019-08-05 10:36:15,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:15,521 WARN L254 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-05 10:36:15,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:16,638 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:16,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:16,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:36:16,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:36:16,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:36:16,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:36:16,640 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-05 10:36:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:18,313 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:36:18,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:36:18,313 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 10:36:18,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:18,314 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:36:18,314 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:36:18,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:36:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:36:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:36:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:36:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:36:18,316 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:36:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:18,316 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:36:18,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:36:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:36:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:36:18,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:18,317 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:36:18,317 INFO L418 AbstractCegarLoop]: === Iteration 43 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:18,318 INFO L82 PathProgramCache]: Analyzing trace with hash 21543136, now seen corresponding path program 42 times [2019-08-05 10:36:18,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:18,340 WARN L254 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 10:36:18,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:19,477 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,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:19,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:36:19,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:36:19,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:36:19,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:36:19,479 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-05 10:36:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:21,053 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:36:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:36:21,054 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 10:36:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:21,054 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:36:21,055 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:36:21,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=2069, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:36:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:36:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:36:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:36:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:36:21,057 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:36:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:21,058 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:36:21,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:36:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:36:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:36:21,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:21,058 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:36:21,059 INFO L418 AbstractCegarLoop]: === Iteration 44 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:21,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash 667835270, now seen corresponding path program 43 times [2019-08-05 10:36:21,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:21,080 WARN L254 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 178 conjunts are in the unsatisfiable core [2019-08-05 10:36:21,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:22,337 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:22,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:22,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:36:22,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:36:22,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:36:22,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:36:22,338 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-05 10:36:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:24,137 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:36:24,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:36:24,142 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 10:36:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:24,142 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:36:24,142 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:36:24,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=2161, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:36:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:36:24,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:36:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:36:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:36:24,144 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:36:24,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:24,144 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:36:24,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:36:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:36:24,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:36:24,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:24,145 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:36:24,145 INFO L418 AbstractCegarLoop]: === Iteration 45 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:24,146 INFO L82 PathProgramCache]: Analyzing trace with hash -771945056, now seen corresponding path program 44 times [2019-08-05 10:36:24,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:24,167 WARN L254 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-05 10:36:24,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:25,426 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:25,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:25,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:36:25,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:36:25,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:36:25,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:36:25,427 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-05 10:36:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:27,138 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:36:27,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:36:27,139 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 10:36:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:27,140 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:36:27,140 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:36:27,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:36:27,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:36:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:36:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:36:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:36:27,143 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:36:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:27,143 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:36:27,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:36:27,144 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:36:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:36:27,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:27,144 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:36:27,145 INFO L418 AbstractCegarLoop]: === Iteration 46 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:27,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:27,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505094, now seen corresponding path program 45 times [2019-08-05 10:36:27,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:27,169 WARN L254 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 10:36:27,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:28,804 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:28,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:28,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:36:28,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:36:28,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:36:28,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:36:28,805 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-05 10:36:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:30,586 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:36:30,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:36:30,587 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 10:36:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:30,587 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:36:30,588 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:36:30,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:36:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:36:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:36:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:36:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:36:30,591 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:36:30,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:30,591 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:36:30,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:36:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:36:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:36:30,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:30,592 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:36:30,592 INFO L418 AbstractCegarLoop]: === Iteration 47 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:30,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:30,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081120, now seen corresponding path program 46 times [2019-08-05 10:36:30,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:30,615 WARN L254 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 190 conjunts are in the unsatisfiable core [2019-08-05 10:36:30,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:32,062 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:32,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:32,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:36:32,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:36:32,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:36:32,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:36:32,063 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-05 10:36:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:34,054 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:36:34,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:36:34,054 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 10:36:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:34,055 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:36:34,056 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:36:34,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=2449, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:36:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:36:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:36:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:36:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:36:34,058 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:36:34,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:34,058 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:36:34,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:36:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:36:34,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:36:34,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:34,059 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:36:34,059 INFO L418 AbstractCegarLoop]: === Iteration 48 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:34,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:34,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192890, now seen corresponding path program 47 times [2019-08-05 10:36:34,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:34,076 WARN L254 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 194 conjunts are in the unsatisfiable core [2019-08-05 10:36:34,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:35,530 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:35,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:35,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:36:35,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:36:35,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:36:35,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:36:35,531 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-05 10:36:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:37,476 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:36:37,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:36:37,477 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 10:36:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:37,478 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:36:37,478 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:36:37,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=103, Invalid=2549, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:36:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:36:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:36:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:36:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:36:37,481 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:36:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:37,481 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:36:37,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:36:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:36:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:36:37,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:37,482 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:36:37,482 INFO L418 AbstractCegarLoop]: === Iteration 49 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:37,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:37,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593312, now seen corresponding path program 48 times [2019-08-05 10:36:37,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:37,509 WARN L254 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 10:36:37,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:39,262 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:39,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:39,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:36:39,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:36:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:36:39,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:36:39,263 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-05 10:36:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:41,282 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:36:41,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:36:41,283 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 10:36:41,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:41,283 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:36:41,283 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:36:41,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=105, Invalid=2651, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:36:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:36:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:36:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:36:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:36:41,287 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:36:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:41,288 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:36:41,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:36:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:36:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:36:41,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:41,289 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:36:41,289 INFO L418 AbstractCegarLoop]: === Iteration 50 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314938, now seen corresponding path program 49 times [2019-08-05 10:36:41,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:41,313 WARN L254 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 202 conjunts are in the unsatisfiable core [2019-08-05 10:36:41,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:42,945 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:42,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:42,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:36:42,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:36:42,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:36:42,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:36:42,946 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-05 10:36:45,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:45,173 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:36:45,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:36:45,174 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 10:36:45,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:45,174 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:36:45,175 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:36:45,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=107, Invalid=2755, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:36:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:36:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:36:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:36:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:36:45,178 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:36:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:45,179 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:36:45,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:36:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:36:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:36:45,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:45,180 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:36:45,180 INFO L418 AbstractCegarLoop]: === Iteration 51 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash -105059360, now seen corresponding path program 50 times [2019-08-05 10:36:45,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:45,210 WARN L254 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 206 conjunts are in the unsatisfiable core [2019-08-05 10:36:45,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:46,805 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:46,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:46,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:36:46,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:36:46,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:36:46,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:36:46,807 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-05 10:36:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:49,138 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:36:49,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:36:49,139 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 10:36:49,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:49,140 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:36:49,140 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:36:49,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:36:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:36:49,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:36:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:36:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:36:49,142 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:36:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:49,143 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:36:49,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:36:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:36:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:36:49,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:49,144 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:36:49,144 INFO L418 AbstractCegarLoop]: === Iteration 52 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:49,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125190, now seen corresponding path program 51 times [2019-08-05 10:36:49,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:49,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-05 10:36:49,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:50,995 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:50,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:50,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:36:50,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:36:50,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:36:50,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:36:50,997 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-05 10:36:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:53,301 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:36:53,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:36:53,302 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 10:36:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:53,303 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:36:53,303 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:36:53,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=111, Invalid=2969, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:36:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:36:53,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:36:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:36:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:36:53,306 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:36:53,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:53,307 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:36:53,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:36:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:36:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:36:53,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:53,307 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:36:53,308 INFO L418 AbstractCegarLoop]: === Iteration 53 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:53,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:53,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107872, now seen corresponding path program 52 times [2019-08-05 10:36:53,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:53,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 214 conjunts are in the unsatisfiable core [2019-08-05 10:36:53,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:55,199 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:55,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:55,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:36:55,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:36:55,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:36:55,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:36:55,200 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-05 10:36:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:57,546 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:36:57,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:36:57,547 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 10:36:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:57,548 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:36:57,548 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:36:57,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:36:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:36:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:36:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:36:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:36:57,551 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:36:57,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:57,551 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:36:57,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:36:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:36:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:36:57,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:57,552 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:36:57,553 INFO L418 AbstractCegarLoop]: === Iteration 54 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:57,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832646, now seen corresponding path program 53 times [2019-08-05 10:36:57,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:57,585 WARN L254 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 218 conjunts are in the unsatisfiable core [2019-08-05 10:36:57,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:59,495 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:59,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:59,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:36:59,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:36:59,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:36:59,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:36:59,496 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-05 10:37:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:01,943 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:37:01,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:37:01,943 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 10:37:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:01,944 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:37:01,944 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:37:01,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=115, Invalid=3191, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:37:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:37:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:37:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:37:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:37:01,947 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:37:01,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:01,947 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:37:01,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:37:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:37:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:37:01,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:01,947 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:37:01,948 INFO L418 AbstractCegarLoop]: === Iteration 55 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:01,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895584, now seen corresponding path program 54 times [2019-08-05 10:37:01,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:01,979 WARN L254 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-05 10:37:01,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:03,743 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:37:03,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:03,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:37:03,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:37:03,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:37:03,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:37:03,745 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-05 10:37:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:06,393 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:37:06,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:37:06,393 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 10:37:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:06,394 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:37:06,394 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:37:06,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=117, Invalid=3305, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:37:06,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:37:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:37:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:37:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:37:06,397 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:37:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:06,397 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:37:06,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:37:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:37:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:37:06,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:06,398 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:37:06,398 INFO L418 AbstractCegarLoop]: === Iteration 56 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:06,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:06,399 INFO L82 PathProgramCache]: Analyzing trace with hash -836059386, now seen corresponding path program 55 times [2019-08-05 10:37:06,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:06,422 WARN L254 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 226 conjunts are in the unsatisfiable core [2019-08-05 10:37:06,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:08,243 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:37:08,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:08,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:37:08,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:37:08,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:37:08,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:37:08,244 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-08-05 10:37:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:10,965 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:37:10,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:37:10,966 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 10:37:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:10,966 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:37:10,967 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:37:10,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=3421, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:37:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:37:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:37:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:37:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:37:10,970 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:37:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:10,970 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:37:10,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:37:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:37:10,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:37:10,971 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:10,971 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:37:10,971 INFO L418 AbstractCegarLoop]: === Iteration 57 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:10,972 INFO L82 PathProgramCache]: Analyzing trace with hash -148039136, now seen corresponding path program 56 times [2019-08-05 10:37:10,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:10,997 WARN L254 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 230 conjunts are in the unsatisfiable core [2019-08-05 10:37:10,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:12,926 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:37:12,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:12,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:37:12,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:37:12,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:37:12,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:37:12,927 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2019-08-05 10:37:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:15,737 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:37:15,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:37:15,737 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-08-05 10:37:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:15,738 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:37:15,738 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:37:15,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=121, Invalid=3539, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:37:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:37:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:37:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:37:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:37:15,741 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:37:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:15,742 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:37:15,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:37:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:37:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:37:15,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:15,742 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:37:15,743 INFO L418 AbstractCegarLoop]: === Iteration 58 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:15,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash -294247866, now seen corresponding path program 57 times [2019-08-05 10:37:15,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:15,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 234 conjunts are in the unsatisfiable core [2019-08-05 10:37:15,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:18,171 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:37:18,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:18,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:37:18,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:37:18,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:37:18,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:37:18,172 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2019-08-05 10:37:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:21,096 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:37:21,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:37:21,097 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2019-08-05 10:37:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:21,098 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:37:21,098 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:37:21,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=123, Invalid=3659, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:37:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:37:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:37:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:37:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:37:21,101 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:37:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:21,102 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:37:21,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:37:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:37:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:37:21,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:21,102 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:37:21,103 INFO L418 AbstractCegarLoop]: === Iteration 59 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:21,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:21,103 INFO L82 PathProgramCache]: Analyzing trace with hash -531751200, now seen corresponding path program 58 times [2019-08-05 10:37:21,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:21,139 WARN L254 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 238 conjunts are in the unsatisfiable core [2019-08-05 10:37:21,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:23,200 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:37:23,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:23,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:37:23,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:37:23,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:37:23,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:37:23,202 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2019-08-05 10:37:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:26,252 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:37:26,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:37:26,252 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2019-08-05 10:37:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:26,253 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:37:26,253 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:37:26,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=3781, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:37:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:37:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:37:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:37:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:37:26,256 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:37:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:26,256 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:37:26,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:37:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:37:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:37:26,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:26,257 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:37:26,257 INFO L418 AbstractCegarLoop]: === Iteration 60 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:26,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:26,257 INFO L82 PathProgramCache]: Analyzing trace with hash 695580038, now seen corresponding path program 59 times [2019-08-05 10:37:26,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:26,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 242 conjunts are in the unsatisfiable core [2019-08-05 10:37:26,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:28,274 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:37:28,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:28,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:37:28,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:37:28,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:37:28,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:37:28,275 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2019-08-05 10:37:31,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:31,353 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:37:31,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:37:31,353 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2019-08-05 10:37:31,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:31,354 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:37:31,354 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:37:31,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=127, Invalid=3905, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:37:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:37:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:37:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:37:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:37:31,357 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:37:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:31,357 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:37:31,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:37:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:37:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:37:31,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:31,358 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:37:31,358 INFO L418 AbstractCegarLoop]: === Iteration 61 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:31,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:31,358 INFO L82 PathProgramCache]: Analyzing trace with hash 88142752, now seen corresponding path program 60 times [2019-08-05 10:37:31,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:31,394 WARN L254 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 246 conjunts are in the unsatisfiable core [2019-08-05 10:37:31,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:33,516 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:37:33,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:33,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:37:33,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:37:33,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:37:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:37:33,517 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2019-08-05 10:37:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:36,744 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:37:36,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:37:36,745 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2019-08-05 10:37:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:36,745 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:37:36,745 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:37:36,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=4031, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:37:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:37:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:37:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:37:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:37:36,748 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:37:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:36,748 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:37:36,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:37:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:37:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:37:36,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:36,748 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:37:36,749 INFO L418 AbstractCegarLoop]: === Iteration 62 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:36,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543930, now seen corresponding path program 61 times [2019-08-05 10:37:36,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:36,786 WARN L254 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 250 conjunts are in the unsatisfiable core [2019-08-05 10:37:36,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:38,963 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:37:38,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:38,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:37:38,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:37:38,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:37:38,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:37:38,964 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2019-08-05 10:37:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:42,286 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:37:42,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:37:42,286 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2019-08-05 10:37:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:42,287 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:37:42,287 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:37:42,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=131, Invalid=4159, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:37:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:37:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:37:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:37:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:37:42,290 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:37:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:42,291 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:37:42,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:37:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:37:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:37:42,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:42,291 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:37:42,291 INFO L418 AbstractCegarLoop]: === Iteration 63 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:42,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:42,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223520, now seen corresponding path program 62 times [2019-08-05 10:37:42,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:42,318 WARN L254 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 254 conjunts are in the unsatisfiable core [2019-08-05 10:37:42,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:44,526 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:37:44,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:44,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:37:44,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:37:44,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:37:44,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:37:44,528 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2019-08-05 10:37:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:47,942 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:37:47,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:37:47,943 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2019-08-05 10:37:47,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:47,943 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:37:47,944 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:37:47,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=133, Invalid=4289, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:37:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:37:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:37:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:37:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:37:47,947 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:37:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:47,947 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:37:47,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:37:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:37:47,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:37:47,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:47,948 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:37:47,948 INFO L418 AbstractCegarLoop]: === Iteration 64 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:47,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:47,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774598, now seen corresponding path program 63 times [2019-08-05 10:37:47,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:47,979 WARN L254 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 258 conjunts are in the unsatisfiable core [2019-08-05 10:37:47,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:50,472 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:37:50,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:50,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:37:50,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:37:50,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:37:50,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:37:50,474 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2019-08-05 10:37:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:53,843 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:37:53,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:37:53,844 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2019-08-05 10:37:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:53,845 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:37:53,845 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:37:53,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=135, Invalid=4421, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:37:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:37:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:37:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:37:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:37:53,848 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:37:53,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:53,849 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:37:53,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:37:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:37:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:37:53,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:53,849 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:37:53,850 INFO L418 AbstractCegarLoop]: === Iteration 65 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:53,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:53,850 INFO L82 PathProgramCache]: Analyzing trace with hash -892596960, now seen corresponding path program 64 times [2019-08-05 10:37:53,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:53,892 WARN L254 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 262 conjunts are in the unsatisfiable core [2019-08-05 10:37:53,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:56,605 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:37:56,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:56,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:37:56,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:37:56,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:37:56,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:37:56,606 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2019-08-05 10:38:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:00,101 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:38:00,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:38:00,102 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2019-08-05 10:38:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:00,103 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:38:00,103 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:38:00,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=137, Invalid=4555, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:38:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:38:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:38:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:38:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:38:00,107 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:38:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:00,107 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:38:00,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:38:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:38:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:38:00,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:00,108 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:38:00,108 INFO L418 AbstractCegarLoop]: === Iteration 66 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:00,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703930, now seen corresponding path program 65 times [2019-08-05 10:38:00,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:00,153 WARN L254 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 266 conjunts are in the unsatisfiable core [2019-08-05 10:38:00,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:02,905 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:38:02,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:02,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:38:02,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:38:02,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:38:02,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:38:02,906 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2019-08-05 10:38:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:06,649 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:38:06,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:38:06,650 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2019-08-05 10:38:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:06,651 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:38:06,651 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:38:06,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=139, Invalid=4691, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:38:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:38:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:38:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:38:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:38:06,653 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:38:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:06,653 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:38:06,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:38:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:38:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:38:06,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:06,654 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:38:06,654 INFO L418 AbstractCegarLoop]: === Iteration 67 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:06,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:06,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718368, now seen corresponding path program 66 times [2019-08-05 10:38:06,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:06,686 WARN L254 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 270 conjunts are in the unsatisfiable core [2019-08-05 10:38:06,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:09,379 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:38:09,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:09,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:38:09,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:38:09,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:38:09,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:38:09,381 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2019-08-05 10:38:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:13,147 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:38:13,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:38:13,148 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2019-08-05 10:38:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:13,148 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:38:13,149 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:38:13,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=141, Invalid=4829, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:38:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:38:13,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:38:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:38:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:38:13,151 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:38:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:13,151 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:38:13,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:38:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:38:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:38:13,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:13,151 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:38:13,152 INFO L418 AbstractCegarLoop]: === Iteration 68 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:13,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:13,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438202, now seen corresponding path program 67 times [2019-08-05 10:38:13,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:13,196 WARN L254 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 274 conjunts are in the unsatisfiable core [2019-08-05 10:38:13,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:16,162 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:38:16,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:16,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:38:16,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:38:16,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:38:16,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:38:16,163 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2019-08-05 10:38:19,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:19,944 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:38:19,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:38:19,945 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2019-08-05 10:38:19,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:19,945 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:38:19,945 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:38:19,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=143, Invalid=4969, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:38:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:38:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:38:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:38:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:38:19,948 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:38:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:19,948 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:38:19,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:38:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:38:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:38:19,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:19,949 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:38:19,949 INFO L418 AbstractCegarLoop]: === Iteration 69 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:19,950 INFO L82 PathProgramCache]: Analyzing trace with hash 976119456, now seen corresponding path program 68 times [2019-08-05 10:38:19,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:19,980 WARN L254 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 278 conjunts are in the unsatisfiable core [2019-08-05 10:38:19,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:22,853 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:38:22,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:22,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:38:22,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:38:22,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:38:22,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:38:22,854 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2019-08-05 10:38:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:26,796 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:38:26,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:38:26,797 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2019-08-05 10:38:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:26,798 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:38:26,798 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:38:26,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=145, Invalid=5111, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:38:26,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:38:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:38:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:38:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:38:26,801 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:38:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:26,801 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:38:26,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:38:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:38:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:38:26,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:26,802 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:38:26,802 INFO L418 AbstractCegarLoop]: === Iteration 70 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:26,803 INFO L82 PathProgramCache]: Analyzing trace with hash 194930118, now seen corresponding path program 69 times [2019-08-05 10:38:26,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:26,833 WARN L254 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 282 conjunts are in the unsatisfiable core [2019-08-05 10:38:26,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:29,498 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:38:29,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:29,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:38:29,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:38:29,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:38:29,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:38:29,499 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2019-08-05 10:38:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:33,531 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:38:33,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:38:33,531 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2019-08-05 10:38:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:33,532 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:38:33,533 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:38:33,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=147, Invalid=5255, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:38:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:38:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:38:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:38:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:38:33,536 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:38:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:33,537 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:38:33,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:38:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:38:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:38:33,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:33,537 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:38:33,538 INFO L418 AbstractCegarLoop]: === Iteration 71 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:33,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:33,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864416, now seen corresponding path program 70 times [2019-08-05 10:38:33,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:33,587 WARN L254 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 286 conjunts are in the unsatisfiable core [2019-08-05 10:38:33,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:36,659 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:38:36,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:36,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:38:36,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:38:36,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:38:36,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:38:36,661 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2019-08-05 10:38:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:41,724 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:38:41,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:38:41,725 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2019-08-05 10:38:41,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:41,726 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:38:41,726 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:38:41,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=149, Invalid=5401, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:38:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:38:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:38:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:38:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:38:41,729 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:38:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:41,729 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:38:41,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:38:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:38:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:38:41,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:41,730 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:38:41,730 INFO L418 AbstractCegarLoop]: === Iteration 72 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779898, now seen corresponding path program 71 times [2019-08-05 10:38:41,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:41,781 WARN L254 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 290 conjunts are in the unsatisfiable core [2019-08-05 10:38:41,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:44,930 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:38:44,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:44,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:38:44,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:38:44,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:38:44,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:38:44,932 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2019-08-05 10:38:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:49,198 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:38:49,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:38:49,198 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2019-08-05 10:38:49,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:49,199 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:38:49,199 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:38:49,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=151, Invalid=5549, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:38:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:38:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:38:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:38:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:38:49,202 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:38:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:49,203 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:38:49,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:38:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:38:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:38:49,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:49,204 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:38:49,204 INFO L418 AbstractCegarLoop]: === Iteration 73 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:49,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:49,204 INFO L82 PathProgramCache]: Analyzing trace with hash 365428768, now seen corresponding path program 72 times [2019-08-05 10:38:49,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:49,256 WARN L254 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 294 conjunts are in the unsatisfiable core [2019-08-05 10:38:49,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:52,931 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:38:52,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:52,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:38:52,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:38:52,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:38:52,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:38:52,933 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2019-08-05 10:38:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:57,222 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:38:57,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:38:57,222 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2019-08-05 10:38:57,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:57,223 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:38:57,223 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:38:57,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=153, Invalid=5699, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:38:57,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:38:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:38:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:38:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:38:57,226 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:38:57,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:57,227 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:38:57,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:38:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:38:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:38:57,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:57,227 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:38:57,228 INFO L418 AbstractCegarLoop]: === Iteration 74 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:57,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612026, now seen corresponding path program 73 times [2019-08-05 10:38:57,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:57,266 WARN L254 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 298 conjunts are in the unsatisfiable core [2019-08-05 10:38:57,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:00,201 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:39:00,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:00,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:39:00,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:39:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:39:00,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:39:00,202 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2019-08-05 10:39:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:04,684 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:39:04,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:39:04,685 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2019-08-05 10:39:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:04,685 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:39:04,686 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:39:04,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=155, Invalid=5851, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:39:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:39:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:39:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:39:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:39:04,688 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:39:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:04,689 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:39:04,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:39:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:39:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:39:04,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:04,689 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:39:04,690 INFO L418 AbstractCegarLoop]: === Iteration 75 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334496, now seen corresponding path program 74 times [2019-08-05 10:39:04,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:04,740 WARN L254 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 302 conjunts are in the unsatisfiable core [2019-08-05 10:39:04,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:08,496 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:39:08,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:08,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:39:08,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:39:08,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:39:08,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:39:08,497 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2019-08-05 10:39:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:13,065 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:39:13,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:39:13,066 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2019-08-05 10:39:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:13,066 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:39:13,066 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:39:13,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=157, Invalid=6005, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:39:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:39:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:39:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:39:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:39:13,069 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:39:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:13,069 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:39:13,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:39:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:39:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:39:13,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:13,070 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:39:13,070 INFO L418 AbstractCegarLoop]: === Iteration 76 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:13,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:13,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600250, now seen corresponding path program 75 times [2019-08-05 10:39:13,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:13,106 WARN L254 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 306 conjunts are in the unsatisfiable core [2019-08-05 10:39:13,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:18,658 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:39:18,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:18,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:39:18,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:39:18,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:39:18,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:39:18,660 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2019-08-05 10:39:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:23,453 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:39:23,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:39:23,454 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2019-08-05 10:39:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:23,455 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:39:23,455 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:39:23,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=159, Invalid=6161, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:39:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:39:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:39:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:39:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:39:23,458 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:39:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:23,458 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:39:23,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:39:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:39:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:39:23,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:23,459 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:39:23,459 INFO L418 AbstractCegarLoop]: === Iteration 77 === [addErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:23,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:23,460 INFO L82 PathProgramCache]: Analyzing trace with hash -268904032, now seen corresponding path program 76 times [2019-08-05 10:39:23,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:23,518 WARN L254 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 310 conjunts are in the unsatisfiable core [2019-08-05 10:39:23,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:26,738 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:39:26,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:26,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:39:26,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:39:26,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:39:26,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:39:26,740 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. Received shutdown request... [2019-08-05 10:39:31,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:39:31,457 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:39:31,461 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:39:31,461 INFO L202 PluginConnector]: Adding new model INT_add_vs_inc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:39:31 BoogieIcfgContainer [2019-08-05 10:39:31,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:39:31,463 INFO L168 Benchmark]: Toolchain (without parser) took 249579.85 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 107.7 MB in the beginning and 20.6 MB in the end (delta: 87.1 MB). Peak memory consumption was 147.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:31,464 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 108.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:39:31,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.98 ms. Allocated memory is still 139.5 MB. Free memory was 107.7 MB in the beginning and 105.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:31,465 INFO L168 Benchmark]: Boogie Preprocessor took 22.13 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 104.7 MB in the end (delta: 872.4 kB). Peak memory consumption was 872.4 kB. Max. memory is 7.1 GB. [2019-08-05 10:39:31,465 INFO L168 Benchmark]: RCFGBuilder took 262.09 ms. Allocated memory is still 139.5 MB. Free memory was 104.7 MB in the beginning and 95.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:31,466 INFO L168 Benchmark]: TraceAbstraction took 249256.24 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 95.3 MB in the beginning and 20.6 MB in the end (delta: 74.6 MB). Peak memory consumption was 135.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:31,469 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.20 ms. Allocated memory is still 139.5 MB. Free memory is still 108.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.98 ms. Allocated memory is still 139.5 MB. Free memory was 107.7 MB in the beginning and 105.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.13 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 104.7 MB in the end (delta: 872.4 kB). Peak memory consumption was 872.4 kB. Max. memory is 7.1 GB. * RCFGBuilder took 262.09 ms. Allocated memory is still 139.5 MB. Free memory was 104.7 MB in the beginning and 95.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249256.24 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 95.3 MB in the beginning and 20.6 MB in the end (delta: 74.6 MB). Peak memory consumption was 135.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and FLOYD_HOARE automaton (currently 79 states, 80 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 249.2s OverallTime, 77 OverallIterations, 76 TraceHistogramMax, 137.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 79 SDslu, 76 SDs, 0 SdLazy, 167322 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3157 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 110.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=76, 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.1s AutomataMinimizationTime, 76 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 109.5s InterpolantComputationTime, 3157 NumberOfCodeBlocks, 3157 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 3080 ConstructedInterpolants, 0 QuantifiedInterpolants, 1773614 SizeOfPredicates, 77 NumberOfNonLiveVariables, 15323 ConjunctsInSsa, 12167 ConjunctsInUnsatCore, 77 InterpolantComputations, 1 PerfectInterpolantSequences, 0/76076 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown