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/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:39:19,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:39:19,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:39:19,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:39:19,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:39:19,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:39:19,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:39:19,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:39:19,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:39:19,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:39:19,968 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:39:19,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:39:19,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:39:19,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:39:19,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:39:19,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:39:19,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:39:19,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:39:19,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:39:19,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:39:19,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:39:19,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:39:19,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:39:19,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:39:19,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:39:19,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:39:19,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:39:19,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:39:19,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:39:19,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:39:19,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:39:19,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:39:19,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:39:19,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:39:19,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:39:19,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:39:19,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:39:19,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:39:19,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:39:19,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:39:19,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:39:20,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:39:20,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:39:20,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:39:20,038 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:39:20,039 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:39:20,039 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2019-08-04 21:39:20,040 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl' [2019-08-04 21:39:20,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:39:20,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:39:20,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:39:20,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:39:20,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:39:20,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:39:20" (1/1) ... [2019-08-04 21:39:20,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:39:20" (1/1) ... [2019-08-04 21:39:20,106 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-04 21:39:20,106 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-04 21:39:20,106 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-04 21:39:20,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:39:20,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:39:20,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:39:20,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:39:20,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:39:20" (1/1) ... [2019-08-04 21:39:20,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:39:20" (1/1) ... [2019-08-04 21:39:20,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:39:20" (1/1) ... [2019-08-04 21:39:20,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:39:20" (1/1) ... [2019-08-04 21:39:20,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:39:20" (1/1) ... [2019-08-04 21:39:20,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:39:20" (1/1) ... [2019-08-04 21:39:20,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:39:20" (1/1) ... [2019-08-04 21:39:20,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:39:20,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:39:20,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:39:20,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:39:20,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:39:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:39:20,200 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-04 21:39:20,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-04 21:39:20,201 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-04 21:39:20,544 INFO L275 CfgBuilder]: Using library mode [2019-08-04 21:39:20,545 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:39:20,546 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:39:20 BoogieIcfgContainer [2019-08-04 21:39:20,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:39:20,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:39:20,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:39:20,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:39:20,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:39:20" (1/2) ... [2019-08-04 21:39:20,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212e69c2 and model type BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:39:20, skipping insertion in model container [2019-08-04 21:39:20,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:39:20" (2/2) ... [2019-08-04 21:39:20,555 INFO L109 eAbstractionObserver]: Analyzing ICFG BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2019-08-04 21:39:20,565 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:39:20,573 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-04 21:39:20,590 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-04 21:39:20,621 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:39:20,621 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:39:20,622 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:39:20,622 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:39:20,622 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:39:20,622 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:39:20,622 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:39:20,623 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:39:20,623 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:39:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-04 21:39:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:39:20,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:20,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:39:20,648 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:20,655 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-08-04 21:39:20,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:20,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:39:20,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:20,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:39:20,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:39:20,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:39:20,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:39:20,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:39:20,855 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-04 21:39:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:20,909 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:39:20,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:39:20,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:39:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:20,920 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:39:20,921 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:39:20,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:39:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:39:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:39:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:39:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:39:20,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-08-04 21:39:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:20,961 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:39:20,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:39:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:39:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:39:20,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:20,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:39:20,964 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:20,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:20,964 INFO L82 PathProgramCache]: Analyzing trace with hash 943126, now seen corresponding path program 1 times [2019-08-04 21:39:20,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:20,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:39:20,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:21,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:21,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:21,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:39:21,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:39:21,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:39:21,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:39:21,118 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-08-04 21:39:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:21,149 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:39:21,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:39:21,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:39:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:21,150 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:39:21,150 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:39:21,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:39:21,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:39:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:39:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:39:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:39:21,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2019-08-04 21:39:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:21,155 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:39:21,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:39:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:39:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:39:21,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:21,156 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:39:21,156 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:21,157 INFO L82 PathProgramCache]: Analyzing trace with hash 29244576, now seen corresponding path program 2 times [2019-08-04 21:39:21,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:21,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:39:21,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:21,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:21,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:21,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:21,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:39:21,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:39:21,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:39:21,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:39:21,313 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-04 21:39:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:21,341 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:39:21,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:39:21,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:39:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:21,345 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:39:21,345 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:39:21,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:39:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:39:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:39:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:39:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:39:21,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2019-08-04 21:39:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:21,350 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:39:21,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:39:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:39:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:39:21,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:21,351 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:39:21,351 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:21,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash 906589526, now seen corresponding path program 3 times [2019-08-04 21:39:21,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:21,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:39:21,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:21,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:21,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:21,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:21,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:21,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:39:21,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:39:21,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:39:21,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:39:21,631 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-08-04 21:39:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:21,730 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:39:21,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:39:21,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:39:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:21,731 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:39:21,732 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:39:21,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:39:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:39:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:39:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:39:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:39:21,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-08-04 21:39:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:21,735 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:39:21,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:39:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:39:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:39:21,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:21,736 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:39:21,737 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1960488096, now seen corresponding path program 4 times [2019-08-04 21:39:21,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:21,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:39:21,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:21,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:21,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:21,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:21,953 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:21,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:21,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:39:21,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:39:21,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:39:21,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:39:21,994 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2019-08-04 21:39:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:22,019 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:39:22,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:39:22,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:39:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:22,021 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:39:22,021 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:39:22,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:39:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:39:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:39:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:39:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:39:22,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2019-08-04 21:39:22,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:22,025 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:39:22,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:39:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:39:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:39:22,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:22,026 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:39:22,027 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:22,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:22,027 INFO L82 PathProgramCache]: Analyzing trace with hash -645581162, now seen corresponding path program 5 times [2019-08-04 21:39:22,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:22,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:39:22,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:22,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:22,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:22,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:22,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:22,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:22,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:22,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:39:22,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:39:22,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:39:22,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:39:22,356 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-04 21:39:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:22,389 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:39:22,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:39:22,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:39:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:22,391 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:39:22,391 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:39:22,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:39:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:39:22,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:39:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:39:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:39:22,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2019-08-04 21:39:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:22,395 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:39:22,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:39:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:39:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:39:22,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:22,396 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:39:22,396 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:22,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1461828128, now seen corresponding path program 6 times [2019-08-04 21:39:22,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:22,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:39:22,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:22,491 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:22,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:22,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:22,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:22,896 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:22,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:22,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:23,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:23,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:39:23,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:39:23,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:39:23,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:39:23,029 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2019-08-04 21:39:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:23,067 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:39:23,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:39:23,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:39:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:23,069 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:39:23,069 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:39:23,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:39:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:39:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:39:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:39:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:39:23,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-08-04 21:39:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:23,072 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:39:23,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:39:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:39:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:39:23,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:23,073 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:39:23,073 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1927960618, now seen corresponding path program 7 times [2019-08-04 21:39:23,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:23,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:39:23,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:23,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:23,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:23,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:39:23,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:39:23,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:39:23,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:39:23,368 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2019-08-04 21:39:23,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:23,403 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:39:23,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:39:23,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:39:23,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:23,404 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:39:23,404 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:39:23,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:39:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:39:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:39:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:39:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:39:23,407 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2019-08-04 21:39:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:23,408 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:39:23,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:39:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:39:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:39:23,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:23,408 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:39:23,409 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:23,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:23,409 INFO L82 PathProgramCache]: Analyzing trace with hash 362770656, now seen corresponding path program 8 times [2019-08-04 21:39:23,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:23,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:39:23,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:23,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,535 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,559 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:23,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:23,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:39:23,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:39:23,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:39:23,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:39:23,722 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2019-08-04 21:39:23,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:23,763 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:39:23,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:39:23,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:39:23,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:23,764 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:39:23,764 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:39:23,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:39:23,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:39:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:39:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:39:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:39:23,767 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2019-08-04 21:39:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:23,768 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:39:23,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:39:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:39:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:39:23,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:23,769 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:39:23,769 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1639003882, now seen corresponding path program 9 times [2019-08-04 21:39:23,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:23,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:39:23,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:23,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:23,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:24,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:24,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:39:24,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:39:24,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:39:24,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:39:24,094 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2019-08-04 21:39:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:24,114 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:39:24,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:39:24,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:39:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:24,116 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:39:24,116 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:39:24,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:39:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:39:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:39:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:39:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:39:24,120 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-08-04 21:39:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:24,120 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:39:24,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:39:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:39:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:39:24,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:24,121 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:39:24,121 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash 730494880, now seen corresponding path program 10 times [2019-08-04 21:39:24,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:24,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:39:24,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:24,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:24,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:24,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:39:24,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:39:24,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:39:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:39:24,447 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2019-08-04 21:39:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:24,498 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:39:24,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:39:24,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:39:24,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:24,499 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:39:24,500 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:39:24,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:39:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:39:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:39:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:39:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:39:24,503 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2019-08-04 21:39:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:24,503 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:39:24,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:39:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:39:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:39:24,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:24,504 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:39:24,504 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:24,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:24,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1170512470, now seen corresponding path program 11 times [2019-08-04 21:39:24,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:24,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:39:24,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:24,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:24,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,017 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:25,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:25,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:25,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:39:25,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:39:25,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:39:25,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:39:25,250 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2019-08-04 21:39:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:25,298 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:39:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:39:25,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:39:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:25,299 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:39:25,299 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:39:25,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:39:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:39:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:39:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:39:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:39:25,305 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2019-08-04 21:39:25,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:25,305 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:39:25,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:39:25,305 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:39:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:39:25,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:25,306 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:39:25,306 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:25,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:25,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1926155872, now seen corresponding path program 12 times [2019-08-04 21:39:25,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:25,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:39:25,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:25,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:25,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:25,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:39:25,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:39:25,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:39:25,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:39:25,824 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2019-08-04 21:39:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:25,857 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:39:25,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:39:25,857 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:39:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:25,858 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:39:25,858 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:39:25,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:39:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:39:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:39:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:39:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:39:25,861 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-08-04 21:39:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:25,861 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:39:25,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:39:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:39:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:39:25,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:25,862 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:39:25,862 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash -418702442, now seen corresponding path program 13 times [2019-08-04 21:39:25,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:25,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:39:25,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:25,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:26,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:26,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:39:26,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:39:26,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:39:26,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:39:26,135 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2019-08-04 21:39:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:26,188 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:39:26,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:39:26,188 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:39:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:26,189 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:39:26,189 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:39:26,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:39:26,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:39:26,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:39:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:39:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:39:26,194 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2019-08-04 21:39:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:26,194 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:39:26,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:39:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:39:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:39:26,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:26,195 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:39:26,195 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:26,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:26,195 INFO L82 PathProgramCache]: Analyzing trace with hash -94866144, now seen corresponding path program 14 times [2019-08-04 21:39:26,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:26,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:39:26,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:26,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:26,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:26,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:39:26,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:39:26,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:39:26,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:39:26,638 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2019-08-04 21:39:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:26,846 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:39:26,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:39:26,849 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:39:26,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:26,850 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:39:26,850 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:39:26,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:39:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:39:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:39:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:39:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:39:26,856 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2019-08-04 21:39:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:26,856 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:39:26,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:39:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:39:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:39:26,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:26,857 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:39:26,857 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:26,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:26,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1354124502, now seen corresponding path program 15 times [2019-08-04 21:39:26,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:26,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:39:26,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:26,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:26,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,180 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:27,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:27,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:39:27,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:39:27,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:39:27,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:39:27,360 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2019-08-04 21:39:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:27,386 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:39:27,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:39:27,386 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:39:27,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:27,387 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:39:27,387 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:39:27,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:39:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:39:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:39:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:39:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:39:27,390 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-08-04 21:39:27,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:27,391 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:39:27,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:39:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:39:27,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:39:27,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:27,392 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:39:27,392 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:27,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:27,392 INFO L82 PathProgramCache]: Analyzing trace with hash -971805728, now seen corresponding path program 16 times [2019-08-04 21:39:27,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:27,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:39:27,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:27,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:27,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:27,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:39:27,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:39:27,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:39:27,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:39:27,936 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2019-08-04 21:39:27,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:27,974 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:39:27,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:39:27,976 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:39:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:27,977 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:39:27,977 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:39:27,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:39:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:39:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:39:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:39:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:39:27,980 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2019-08-04 21:39:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:27,980 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:39:27,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:39:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:39:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:39:27,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:27,981 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:39:27,981 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:27,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:27,982 INFO L82 PathProgramCache]: Analyzing trace with hash -61198826, now seen corresponding path program 17 times [2019-08-04 21:39:27,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:27,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:39:28,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:28,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:28,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:28,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:39:28,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:39:28,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:39:28,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:39:28,442 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2019-08-04 21:39:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:28,501 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:39:28,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:39:28,502 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:39:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:28,502 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:39:28,503 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:39:28,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:39:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:39:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:39:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:39:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:39:28,507 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2019-08-04 21:39:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:28,507 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:39:28,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:39:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:39:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:39:28,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:28,508 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:39:28,508 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:28,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:28,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1897155936, now seen corresponding path program 18 times [2019-08-04 21:39:28,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:28,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:39:28,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:28,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:28,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:29,480 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:29,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:29,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:39:29,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:39:29,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:39:29,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:39:29,486 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2019-08-04 21:39:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:29,763 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:39:29,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:39:29,763 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:39:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:29,764 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:39:29,764 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:39:29,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:39:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:39:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:39:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:39:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:39:29,767 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-08-04 21:39:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:29,767 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:39:29,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:39:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:39:29,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:39:29,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:29,768 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:39:29,769 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:29,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:29,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1317715798, now seen corresponding path program 19 times [2019-08-04 21:39:29,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:29,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:39:29,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:29,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:29,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:29,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:29,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:29,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:29,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:29,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:29,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:29,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:29,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:29,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:29,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:30,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:30,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:39:30,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:39:30,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:39:30,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:39:30,248 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2019-08-04 21:39:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:30,278 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:39:30,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:39:30,279 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:39:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:30,280 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:39:30,280 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:39:30,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:39:30,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:39:30,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:39:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:39:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:39:30,284 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2019-08-04 21:39:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:30,284 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:39:30,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:39:30,285 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:39:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:39:30,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:30,285 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:39:30,286 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:30,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2100475552, now seen corresponding path program 20 times [2019-08-04 21:39:30,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:30,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:39:30,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:30,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:30,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:30,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:39:30,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:39:30,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:39:30,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:39:30,870 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2019-08-04 21:39:30,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:30,903 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:39:30,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:39:30,904 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:39:30,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:30,904 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:39:30,905 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:39:30,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:39:30,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:39:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:39:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:39:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:39:30,909 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2019-08-04 21:39:30,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:30,909 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:39:30,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:39:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:39:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:39:30,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:30,910 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:39:30,910 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:30,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash -690225002, now seen corresponding path program 21 times [2019-08-04 21:39:30,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:30,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:39:30,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:30,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:31,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:31,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:39:31,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:39:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:39:31,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:39:31,585 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2019-08-04 21:39:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:31,680 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:39:31,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:39:31,682 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:39:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:31,683 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:39:31,683 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:39:31,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:39:31,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:39:31,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:39:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:39:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:39:31,687 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-08-04 21:39:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:31,687 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:39:31,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:39:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:39:31,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:39:31,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:31,688 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:39:31,688 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:31,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:31,689 INFO L82 PathProgramCache]: Analyzing trace with hash 77869088, now seen corresponding path program 22 times [2019-08-04 21:39:31,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:31,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:39:31,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:31,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,909 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:31,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:32,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:32,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:39:32,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:39:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:39:32,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:39:32,173 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2019-08-04 21:39:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:32,218 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:39:32,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:39:32,225 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:39:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:32,226 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:39:32,226 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:39:32,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:39:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:39:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:39:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:39:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:39:32,229 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2019-08-04 21:39:32,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:32,230 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:39:32,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:39:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:39:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:39:32,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:32,230 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:39:32,231 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:32,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:32,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1881017898, now seen corresponding path program 23 times [2019-08-04 21:39:32,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:32,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:39:32,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:32,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:32,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:33,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:33,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:39:33,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:39:33,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:39:33,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:39:33,018 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2019-08-04 21:39:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:33,075 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:39:33,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:39:33,075 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:39:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:33,076 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:39:33,076 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:39:33,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:39:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:39:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:39:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:39:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:39:33,080 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2019-08-04 21:39:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:33,081 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:39:33,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:39:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:39:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:39:33,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:33,082 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:39:33,082 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1817994976, now seen corresponding path program 24 times [2019-08-04 21:39:33,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:33,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:39:33,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:33,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,433 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:33,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:34,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:34,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:39:34,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:39:34,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:39:34,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:39:34,024 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2019-08-04 21:39:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:34,057 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:39:34,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:39:34,058 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:39:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:34,058 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:39:34,059 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:39:34,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:39:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:39:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:39:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:39:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:39:34,062 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-08-04 21:39:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:34,062 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:39:34,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:39:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:39:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:39:34,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:34,063 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:39:34,063 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:34,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash 523277078, now seen corresponding path program 25 times [2019-08-04 21:39:34,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:34,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:39:34,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:34,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:34,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:34,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:39:34,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:39:34,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:39:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:39:34,790 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2019-08-04 21:39:34,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:34,933 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:39:34,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:39:34,933 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:39:34,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:34,934 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:39:34,934 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:39:34,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:39:34,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:39:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:39:34,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:39:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:39:34,938 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2019-08-04 21:39:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:34,938 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:39:34,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:39:34,939 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:39:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:39:34,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:34,941 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:39:34,941 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:34,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:34,941 INFO L82 PathProgramCache]: Analyzing trace with hash -958272096, now seen corresponding path program 26 times [2019-08-04 21:39:34,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:34,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:39:34,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:34,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:35,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:35,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:39:35,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:39:35,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:39:36,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:39:36,000 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2019-08-04 21:39:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:36,034 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:39:36,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:39:36,035 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:39:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:36,035 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:39:36,036 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:39:36,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:39:36,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:39:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:39:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:39:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:39:36,040 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2019-08-04 21:39:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:36,040 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:39:36,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:39:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:39:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:39:36,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:36,041 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:39:36,041 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:36,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:36,042 INFO L82 PathProgramCache]: Analyzing trace with hash 358343766, now seen corresponding path program 27 times [2019-08-04 21:39:36,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:36,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:39:36,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:36,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:36,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:36,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:39:36,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:39:36,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:39:36,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:39:36,797 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2019-08-04 21:39:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:36,860 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:39:36,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:39:36,860 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:39:36,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:36,861 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:39:36,861 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:39:36,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:39:36,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:39:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:39:36,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:39:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:39:36,866 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-08-04 21:39:36,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:36,866 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:39:36,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:39:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:39:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:39:36,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:36,867 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:39:36,867 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:36,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:36,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1776237472, now seen corresponding path program 28 times [2019-08-04 21:39:36,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:36,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:39:36,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:36,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,134 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:37,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,158 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,222 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:37,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:38,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:38,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:39:38,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:39:38,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:39:38,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:39:38,016 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2019-08-04 21:39:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:38,094 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:39:38,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:39:38,094 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:39:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:38,095 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:39:38,095 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:39:38,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:39:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:39:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:39:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:39:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:39:38,098 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2019-08-04 21:39:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:38,098 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:39:38,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:39:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:39:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:39:38,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:38,099 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:39:38,099 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:38,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:38,099 INFO L82 PathProgramCache]: Analyzing trace with hash 771220886, now seen corresponding path program 29 times [2019-08-04 21:39:38,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:38,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:39:38,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:38,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:38,791 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:38,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:38,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:39:38,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:39:38,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:39:38,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:39:38,793 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2019-08-04 21:39:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:38,915 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:39:38,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:39:38,916 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:39:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:38,917 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:39:38,917 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:39:38,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:39:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:39:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:39:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:39:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:39:38,921 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2019-08-04 21:39:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:38,921 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:39:38,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:39:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:39:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:39:38,922 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:38,922 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:39:38,922 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:38,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:38,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1861948640, now seen corresponding path program 30 times [2019-08-04 21:39:38,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:38,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:39:38,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:39,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,169 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:39,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,395 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:39,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,893 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:40,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:40,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:39:40,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:39:40,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:39:40,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:39:40,122 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2019-08-04 21:39:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:40,179 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:39:40,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:39:40,180 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:39:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:40,181 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:39:40,181 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:39:40,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:39:40,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:39:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:39:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:39:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:39:40,185 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-08-04 21:39:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:40,186 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:39:40,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:39:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:39:40,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:39:40,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:40,186 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:39:40,187 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:40,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:40,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1885825322, now seen corresponding path program 31 times [2019-08-04 21:39:40,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:40,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:39:40,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:40,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,433 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,642 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,663 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:40,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:41,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:41,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:39:41,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:39:41,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:39:41,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:39:41,136 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2019-08-04 21:39:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:41,191 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:39:41,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:39:41,196 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:39:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:41,197 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:39:41,197 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:39:41,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:39:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:39:41,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:39:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:39:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:39:41,201 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2019-08-04 21:39:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:41,201 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:39:41,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:39:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:39:41,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:39:41,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:41,202 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:39:41,202 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:41,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:41,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1668964832, now seen corresponding path program 32 times [2019-08-04 21:39:41,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:41,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:39:41,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:41,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:41,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:42,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:42,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:39:42,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:39:42,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:39:42,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:39:42,010 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2019-08-04 21:39:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:42,049 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:39:42,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:39:42,049 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:39:42,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:42,050 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:39:42,050 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:39:42,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:39:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:39:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:39:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:39:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:39:42,054 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2019-08-04 21:39:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:42,054 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:39:42,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:39:42,055 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:39:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:39:42,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:42,055 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:39:42,055 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:42,056 INFO L82 PathProgramCache]: Analyzing trace with hash 198309910, now seen corresponding path program 33 times [2019-08-04 21:39:42,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:42,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:39:42,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:42,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,434 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:42,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:42,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:39:42,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:39:42,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:39:42,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:39:42,953 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2019-08-04 21:39:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:43,068 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:39:43,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:39:43,068 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:39:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:43,069 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:39:43,069 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:39:43,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:39:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:39:43,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:39:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:39:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:39:43,071 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-08-04 21:39:43,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:43,072 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:39:43,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:39:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:39:43,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:39:43,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:43,073 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:39:43,073 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:43,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:43,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1852647584, now seen corresponding path program 34 times [2019-08-04 21:39:43,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:43,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:39:43,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:43,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:43,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:44,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:44,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:44,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:44,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:39:44,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:39:44,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:39:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:39:44,098 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2019-08-04 21:39:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:44,137 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:39:44,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:39:44,137 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:39:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:44,138 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:39:44,138 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:39:44,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:39:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:39:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:39:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:39:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:39:44,141 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2019-08-04 21:39:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:44,142 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:39:44,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:39:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:39:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:39:44,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:44,143 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:39:44,143 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:44,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:44,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1597507926, now seen corresponding path program 35 times [2019-08-04 21:39:44,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:44,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:39:44,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:44,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:44,384 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:44,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:44,605 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:44,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:44,864 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:44,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,108 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:45,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,732 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:45,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:45,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:39:45,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:39:45,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:39:45,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:39:45,995 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 38 states. [2019-08-04 21:39:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:46,062 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:39:46,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:39:46,063 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:39:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:46,063 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:39:46,064 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:39:46,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:39:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:39:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:39:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:39:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:39:46,067 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2019-08-04 21:39:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:46,067 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:39:46,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:39:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:39:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:39:46,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:46,068 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:39:46,068 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:46,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2016854176, now seen corresponding path program 36 times [2019-08-04 21:39:46,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:46,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:39:46,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:46,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:46,322 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:46,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:46,548 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:46,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:46,792 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:46,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,014 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:47,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:47,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:47,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:39:47,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:39:47,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:39:47,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:39:47,856 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. [2019-08-04 21:39:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:47,909 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:39:47,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:39:47,910 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:39:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:47,911 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:39:47,911 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:39:47,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:39:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:39:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:39:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:39:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:39:47,914 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-08-04 21:39:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:47,915 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:39:47,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:39:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:39:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:39:47,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:47,915 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:39:47,916 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:47,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:47,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1902037654, now seen corresponding path program 37 times [2019-08-04 21:39:47,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:47,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:39:47,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:47,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,179 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:48,180 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,353 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-04 21:39:48,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,535 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:48,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:49,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:49,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:39:49,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:39:49,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:39:49,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:39:49,219 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 40 states. [2019-08-04 21:39:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:49,282 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:39:49,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:39:49,283 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:39:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:49,284 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:39:49,284 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:39:49,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:39:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:39:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:39:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:39:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:39:49,287 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2019-08-04 21:39:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:49,287 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:39:49,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:39:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:39:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:39:49,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:49,288 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:39:49,288 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:49,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:49,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1166367200, now seen corresponding path program 38 times [2019-08-04 21:39:49,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:49,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:39:49,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:49,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,595 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,732 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:49,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:50,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:50,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:39:50,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:39:50,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:39:50,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:39:50,365 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 41 states. [2019-08-04 21:39:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:50,412 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:39:50,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:39:50,413 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:39:50,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:50,414 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:39:50,414 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:39:50,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:39:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:39:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:39:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:39:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:39:50,417 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2019-08-04 21:39:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:50,417 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:39:50,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:39:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:39:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:39:50,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:50,418 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:39:50,418 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1797637162, now seen corresponding path program 39 times [2019-08-04 21:39:50,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:50,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:39:50,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:50,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:51,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:52,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:52,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:39:52,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:39:52,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:39:52,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:39:52,154 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 42 states. [2019-08-04 21:39:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:52,224 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:39:52,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:39:52,224 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:39:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:52,225 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:39:52,225 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:39:52,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:39:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:39:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:39:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:39:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:39:52,228 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-08-04 21:39:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:52,228 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:39:52,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:39:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:39:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:39:52,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:52,229 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:39:52,229 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:52,230 INFO L82 PathProgramCache]: Analyzing trace with hash 107830496, now seen corresponding path program 40 times [2019-08-04 21:39:52,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:52,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:39:52,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:52,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:52,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,180 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,475 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:53,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:53,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:39:53,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:39:53,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:39:53,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:39:53,515 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 43 states. [2019-08-04 21:39:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:53,562 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:39:53,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:39:53,572 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:39:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:53,573 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:39:53,573 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:39:53,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:39:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:39:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:39:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:39:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:39:53,576 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2019-08-04 21:39:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:53,576 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:39:53,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:39:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:39:53,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:39:53,576 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:53,577 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:39:53,577 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:53,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:53,577 INFO L82 PathProgramCache]: Analyzing trace with hash -952214250, now seen corresponding path program 41 times [2019-08-04 21:39:53,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:53,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:39:53,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:53,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,695 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:53,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,180 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:54,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:54,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:39:54,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:39:54,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:39:54,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:39:54,665 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 44 states. [2019-08-04 21:39:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:54,740 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:39:54,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:39:54,741 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:39:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:54,742 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:39:54,742 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:39:54,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:39:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:39:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:39:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:39:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:39:54,745 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2019-08-04 21:39:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:54,745 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:39:54,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:39:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:39:54,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:39:54,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:54,746 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:39:54,746 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:54,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:54,746 INFO L82 PathProgramCache]: Analyzing trace with hash 546136992, now seen corresponding path program 42 times [2019-08-04 21:39:54,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:54,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:39:54,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:54,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:54,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:55,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:56,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:56,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:39:56,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:39:56,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:39:56,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:39:56,055 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 45 states. [2019-08-04 21:39:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:56,111 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:39:56,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:39:56,112 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:39:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:56,112 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:39:56,113 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:39:56,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:39:56,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:39:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:39:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:39:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:39:56,115 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-08-04 21:39:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:56,116 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:39:56,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:39:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:39:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:39:56,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:56,116 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:39:56,117 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:56,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:56,117 INFO L82 PathProgramCache]: Analyzing trace with hash -249614762, now seen corresponding path program 43 times [2019-08-04 21:39:56,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:56,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:39:56,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:56,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:57,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:57,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:39:57,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:39:57,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:39:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:39:57,333 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 46 states. [2019-08-04 21:39:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:57,458 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:39:57,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:39:57,458 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:39:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:57,459 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:39:57,459 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:39:57,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:39:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:39:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:39:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:39:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:39:57,463 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2019-08-04 21:39:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:57,463 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:39:57,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:39:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:39:57,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:39:57,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:57,464 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:39:57,464 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:57,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:57,464 INFO L82 PathProgramCache]: Analyzing trace with hash 851884640, now seen corresponding path program 44 times [2019-08-04 21:39:57,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:57,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:39:57,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:57,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,893 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:57,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:58,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:58,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:39:58,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:39:58,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:39:58,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:39:58,848 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 47 states. [2019-08-04 21:39:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:59,119 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:39:59,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:39:59,119 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:39:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:59,120 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:39:59,120 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:39:59,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:39:59,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:39:59,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:39:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:39:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:39:59,123 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2019-08-04 21:39:59,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:59,124 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:39:59,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:39:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:39:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:39:59,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:59,125 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:39:59,125 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:59,126 INFO L82 PathProgramCache]: Analyzing trace with hash 638627734, now seen corresponding path program 45 times [2019-08-04 21:39:59,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:59,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:39:59,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:59,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:59,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:00,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:00,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:40:00,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:40:00,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:40:00,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:40:00,391 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 48 states. [2019-08-04 21:40:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:00,443 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:40:00,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:40:00,443 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:40:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:00,444 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:40:00,444 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:40:00,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:40:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:40:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:40:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:40:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:40:00,447 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-08-04 21:40:00,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:00,447 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:40:00,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:40:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:40:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:40:00,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:00,448 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:40:00,448 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:00,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:00,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1677369056, now seen corresponding path program 46 times [2019-08-04 21:40:00,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:00,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:40:00,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:00,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:00,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:01,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:01,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:40:01,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:40:01,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:40:01,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:40:01,929 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 49 states. [2019-08-04 21:40:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:02,045 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:40:02,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:40:02,046 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:40:02,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:02,047 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:40:02,047 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:40:02,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:40:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:40:02,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:40:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:40:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:40:02,050 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2019-08-04 21:40:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:02,050 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:40:02,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:40:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:40:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:40:02,051 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:02,051 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:40:02,051 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:02,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:02,051 INFO L82 PathProgramCache]: Analyzing trace with hash -458825514, now seen corresponding path program 47 times [2019-08-04 21:40:02,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:02,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:40:02,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:02,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:02,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:03,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:03,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:40:03,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:40:03,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:40:03,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:40:03,585 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 50 states. [2019-08-04 21:40:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:03,687 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:40:03,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:40:03,687 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:40:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:03,688 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:40:03,688 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:40:03,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:40:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:40:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:40:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:40:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:40:03,692 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2019-08-04 21:40:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:03,692 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:40:03,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:40:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:40:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:40:03,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:03,693 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:40:03,693 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:03,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1338681376, now seen corresponding path program 48 times [2019-08-04 21:40:03,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:03,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:40:03,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:03,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,909 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:03,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:04,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,158 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:05,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:05,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:40:05,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:40:05,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:40:05,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:40:05,454 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 51 states. [2019-08-04 21:40:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:05,511 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:40:05,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:40:05,511 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:40:05,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:05,512 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:40:05,512 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:40:05,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:40:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:40:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:40:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:40:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:40:05,515 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-08-04 21:40:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:05,516 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:40:05,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:40:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:40:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:40:05,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:05,517 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:40:05,517 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:05,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:05,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1450557974, now seen corresponding path program 49 times [2019-08-04 21:40:05,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:05,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:40:05,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:05,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:05,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,180 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,642 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:06,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:06,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:40:06,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:40:06,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:40:06,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:40:06,945 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 52 states. [2019-08-04 21:40:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:07,016 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:40:07,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:40:07,017 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:40:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:07,017 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:40:07,017 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:40:07,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:40:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:40:07,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:40:07,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:40:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:40:07,020 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2019-08-04 21:40:07,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:07,021 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:40:07,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:40:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:40:07,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:40:07,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:07,022 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:40:07,023 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:07,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:07,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2017631904, now seen corresponding path program 50 times [2019-08-04 21:40:07,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:07,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:40:07,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:07,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,230 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:07,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:08,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:08,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:40:08,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:40:08,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:40:08,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:40:08,747 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 53 states. [2019-08-04 21:40:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:08,827 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:40:08,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:40:08,828 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:40:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:08,829 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:40:08,829 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:40:08,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:40:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:40:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:40:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:40:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:40:08,832 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2019-08-04 21:40:08,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:08,832 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:40:08,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:40:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:40:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:40:08,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:08,833 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:40:08,834 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1877912746, now seen corresponding path program 51 times [2019-08-04 21:40:08,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:08,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:40:08,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:10,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:10,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:40:10,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:40:10,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:40:10,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:40:10,094 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 54 states. [2019-08-04 21:40:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:12,195 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:40:12,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:40:12,195 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:40:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:12,196 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:40:12,196 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:40:12,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:40:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:40:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:40:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:40:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:40:12,201 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-08-04 21:40:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:12,201 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:40:12,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:40:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:40:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:40:12,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:12,202 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:40:12,202 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:12,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1914254688, now seen corresponding path program 52 times [2019-08-04 21:40:12,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:12,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:40:12,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:13,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:13,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:40:13,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:40:13,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:40:13,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:40:13,414 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 55 states. [2019-08-04 21:40:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:16,513 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:40:16,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:40:16,513 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:40:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:16,514 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:40:16,514 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:40:16,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:40:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:40:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:40:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:40:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:40:16,517 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2019-08-04 21:40:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:16,517 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:40:16,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:40:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:40:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:40:16,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:16,518 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:40:16,518 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash -787639146, now seen corresponding path program 53 times [2019-08-04 21:40:16,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:16,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:40:16,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:17,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:17,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:40:17,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:40:17,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:40:17,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:40:17,796 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 56 states. [2019-08-04 21:40:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:19,797 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:40:19,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:40:19,798 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:40:19,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:19,799 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:40:19,799 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:40:19,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:40:19,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:40:19,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:40:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:40:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:40:19,802 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2019-08-04 21:40:19,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:19,802 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:40:19,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:40:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:40:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:40:19,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:19,803 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:40:19,803 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:19,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:19,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1352997920, now seen corresponding path program 54 times [2019-08-04 21:40:19,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:19,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:40:19,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:21,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:21,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:40:21,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:40:21,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:40:21,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:40:21,191 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 57 states. [2019-08-04 21:40:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:23,227 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:40:23,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:40:23,227 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:40:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:23,228 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:40:23,228 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:40:23,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:40:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:40:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:40:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:40:23,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:40:23,231 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-08-04 21:40:23,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:23,231 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:40:23,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:40:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:40:23,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:40:23,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:23,232 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:40:23,233 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:23,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:23,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1006729770, now seen corresponding path program 55 times [2019-08-04 21:40:23,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:23,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:40:23,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:25,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:25,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:40:25,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:40:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:40:25,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:40:25,093 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 58 states. [2019-08-04 21:40:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:27,161 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:40:27,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:40:27,161 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:40:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:27,162 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:40:27,162 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:40:27,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:40:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:40:27,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:40:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:40:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:40:27,164 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2019-08-04 21:40:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:27,164 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:40:27,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:40:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:40:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:40:27,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:27,165 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:40:27,166 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:27,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1143844128, now seen corresponding path program 56 times [2019-08-04 21:40:27,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:27,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:40:27,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:28,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:28,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:40:28,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:40:28,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:40:28,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:40:28,505 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 59 states. [2019-08-04 21:40:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:30,789 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:40:30,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:40:30,789 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:40:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:30,790 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:40:30,790 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:40:30,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:40:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:40:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:40:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:40:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:40:30,793 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2019-08-04 21:40:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:30,793 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:40:30,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:40:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:40:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:40:30,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:30,794 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:40:30,794 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1099421930, now seen corresponding path program 57 times [2019-08-04 21:40:30,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:30,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:40:30,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:32,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:32,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:40:32,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:40:32,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:40:32,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:40:32,130 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 60 states. [2019-08-04 21:40:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:34,502 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:40:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:40:34,503 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:40:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:34,504 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:40:34,504 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:40:34,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:40:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:40:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:40:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:40:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:40:34,507 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-08-04 21:40:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:34,507 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:40:34,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:40:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:40:34,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:40:34,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:34,508 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:40:34,508 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:34,509 INFO L82 PathProgramCache]: Analyzing trace with hash 277666208, now seen corresponding path program 58 times [2019-08-04 21:40:34,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:34,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:40:34,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:36,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:36,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:40:36,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:40:36,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:40:36,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:40:36,165 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 61 states. [2019-08-04 21:40:38,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:38,463 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:40:38,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:40:38,464 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:40:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:38,465 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:40:38,465 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:40:38,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:40:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:40:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:40:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:40:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:40:38,467 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2019-08-04 21:40:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:38,467 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:40:38,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:40:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:40:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:40:38,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:38,467 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:40:38,468 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash 17725526, now seen corresponding path program 59 times [2019-08-04 21:40:38,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:38,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:40:38,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:40,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:40,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:40:40,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:40:40,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:40:40,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:40:40,098 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 62 states. [2019-08-04 21:40:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:42,441 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:40:42,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:40:42,441 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:40:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:42,442 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:40:42,442 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:40:42,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:40:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:40:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:40:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:40:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:40:42,445 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2019-08-04 21:40:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:42,445 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:40:42,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:40:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:40:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:40:42,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:42,446 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:40:42,446 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:42,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:42,446 INFO L82 PathProgramCache]: Analyzing trace with hash 549498976, now seen corresponding path program 60 times [2019-08-04 21:40:42,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:42,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:40:42,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:43,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:43,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:40:43,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:40:43,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:40:43,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:40:43,892 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 63 states. [2019-08-04 21:40:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:46,537 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:40:46,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:40:46,537 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:40:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:46,538 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:40:46,538 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:40:46,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:40:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:40:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:40:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:40:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:40:46,540 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-08-04 21:40:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:46,540 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:40:46,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:40:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:40:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:40:46,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:46,541 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:40:46,541 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:46,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:46,541 INFO L82 PathProgramCache]: Analyzing trace with hash -145393258, now seen corresponding path program 61 times [2019-08-04 21:40:46,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:46,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:40:46,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:48,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:48,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:40:48,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:40:48,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:40:48,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:40:48,086 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 64 states. [2019-08-04 21:40:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:50,814 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:40:50,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:40:50,815 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:40:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:50,816 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:40:50,816 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:40:50,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:40:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:40:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:40:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:40:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:40:50,819 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2019-08-04 21:40:50,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:50,819 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:40:50,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:40:50,819 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:40:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:40:50,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:50,820 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:40:50,820 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:50,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:50,820 INFO L82 PathProgramCache]: Analyzing trace with hash -212216032, now seen corresponding path program 62 times [2019-08-04 21:40:50,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:50,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:40:50,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:52,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:52,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:40:52,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:40:52,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:40:52,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:40:52,372 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 65 states. [2019-08-04 21:40:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:55,182 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:40:55,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:40:55,182 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:40:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:55,183 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:40:55,183 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:40:55,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:40:55,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:40:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:40:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:40:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:40:55,186 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2019-08-04 21:40:55,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:55,187 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:40:55,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:40:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:40:55,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:40:55,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:55,187 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:40:55,188 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:55,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:55,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2011245270, now seen corresponding path program 63 times [2019-08-04 21:40:55,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:55,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:40:55,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:56,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:56,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:40:56,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:40:56,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:40:56,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:40:56,777 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 66 states. [2019-08-04 21:40:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:59,426 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:40:59,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:40:59,426 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:40:59,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:59,427 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:40:59,427 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:40:59,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:40:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:40:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:40:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:40:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:40:59,430 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-08-04 21:40:59,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:59,431 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:40:59,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:40:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:40:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:40:59,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:59,432 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:40:59,432 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2075898400, now seen corresponding path program 64 times [2019-08-04 21:40:59,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:59,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-04 21:40:59,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:01,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:01,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:41:01,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:41:01,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:41:01,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:41:01,326 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 67 states. [2019-08-04 21:41:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:04,136 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:41:04,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:41:04,136 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:41:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:04,137 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:41:04,137 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:41:04,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:41:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:41:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:41:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:41:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:41:04,139 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2019-08-04 21:41:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:04,139 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:41:04,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:41:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:41:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:41:04,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:04,140 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:41:04,140 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:04,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:04,140 INFO L82 PathProgramCache]: Analyzing trace with hash 71666710, now seen corresponding path program 65 times [2019-08-04 21:41:04,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:04,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:41:04,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:06,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:06,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:41:06,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:41:06,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:41:06,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:41:06,121 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 68 states. [2019-08-04 21:41:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:08,949 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:41:08,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:41:08,950 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:41:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:08,951 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:41:08,951 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:41:08,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:41:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:41:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:41:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:41:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:41:08,953 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2019-08-04 21:41:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:08,953 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:41:08,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:41:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:41:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:41:08,954 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:08,954 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:41:08,954 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:08,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:08,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2073291616, now seen corresponding path program 66 times [2019-08-04 21:41:08,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:08,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:41:08,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:11,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:11,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:41:11,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:41:11,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:41:11,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:41:11,003 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 69 states. [2019-08-04 21:41:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:13,895 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:41:13,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:41:13,895 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:41:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:13,896 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:41:13,896 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:41:13,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:41:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:41:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:41:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:41:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:41:13,899 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-08-04 21:41:13,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:13,899 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:41:13,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:41:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:41:13,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:41:13,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:13,900 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:41:13,900 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:13,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:13,901 INFO L82 PathProgramCache]: Analyzing trace with hash 152477014, now seen corresponding path program 67 times [2019-08-04 21:41:13,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:13,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-04 21:41:13,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:15,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:15,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:41:15,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:41:15,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:41:15,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:41:15,972 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 70 states. [2019-08-04 21:41:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:18,980 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:41:18,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:41:18,981 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:41:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:18,982 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:41:18,982 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:41:18,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:41:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:41:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:41:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:41:18,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:41:18,985 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2019-08-04 21:41:18,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:18,985 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:41:18,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:41:18,985 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:41:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:41:18,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:18,986 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:41:18,986 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:18,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:18,987 INFO L82 PathProgramCache]: Analyzing trace with hash 431827808, now seen corresponding path program 68 times [2019-08-04 21:41:18,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:19,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:41:19,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:21,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:21,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:41:21,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:41:21,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:41:21,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:41:21,074 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 71 states. [2019-08-04 21:41:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:24,146 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:41:24,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:41:24,147 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:41:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:24,148 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:41:24,148 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:41:24,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:41:24,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:41:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:41:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:41:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:41:24,151 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2019-08-04 21:41:24,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:24,152 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:41:24,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:41:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:41:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:41:24,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:24,153 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:41:24,153 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:24,153 INFO L82 PathProgramCache]: Analyzing trace with hash 501767830, now seen corresponding path program 69 times [2019-08-04 21:41:24,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:24,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:41:24,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:26,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:26,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:41:26,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:41:26,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:41:26,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:41:26,350 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 72 states. [2019-08-04 21:41:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:29,539 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:41:29,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:41:29,540 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:41:29,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:29,541 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:41:29,541 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:41:29,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:41:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:41:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:41:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:41:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:41:29,544 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-08-04 21:41:29,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:29,544 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:41:29,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:41:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:41:29,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:41:29,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:29,545 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:41:29,545 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:29,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:29,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1625058784, now seen corresponding path program 70 times [2019-08-04 21:41:29,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:29,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-04 21:41:29,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:31,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:31,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:41:31,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:41:31,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:41:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:41:31,870 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 73 states. [2019-08-04 21:41:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:35,183 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:41:35,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:41:35,184 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:41:35,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:35,184 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:41:35,185 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:41:35,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:41:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:41:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:41:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:41:35,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:41:35,188 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2019-08-04 21:41:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:35,188 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:41:35,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:41:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:41:35,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:41:35,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:35,189 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:41:35,189 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:35,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1162792918, now seen corresponding path program 71 times [2019-08-04 21:41:35,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:35,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:41:35,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:37,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:37,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:41:37,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:41:37,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:41:37,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:41:37,506 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 74 states. [2019-08-04 21:41:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:41,021 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:41:41,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:41:41,021 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:41:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:41,022 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:41:41,022 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:41:41,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:41:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:41:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:41:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:41:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:41:41,024 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2019-08-04 21:41:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:41,025 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:41:41,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:41:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:41:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:41:41,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:41,026 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:41:41,026 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:41,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:41,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1686849760, now seen corresponding path program 72 times [2019-08-04 21:41:41,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:41,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:41:41,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:43,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:43,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:41:43,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:41:43,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:41:43,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:41:43,237 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 75 states. [2019-08-04 21:41:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:46,825 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:41:46,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:41:46,825 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:41:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:46,826 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:41:46,826 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:41:46,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:41:46,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:41:46,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:41:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:41:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:41:46,832 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-08-04 21:41:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:46,832 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:41:46,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:41:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:41:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:41:46,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:46,833 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:41:46,833 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:46,834 INFO L82 PathProgramCache]: Analyzing trace with hash 752742678, now seen corresponding path program 73 times [2019-08-04 21:41:46,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:46,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:41:46,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:49,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:49,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:41:49,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:41:49,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:41:49,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:41:49,032 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 76 states. [2019-08-04 21:41:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:52,797 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:41:52,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:41:52,798 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:41:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:52,799 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:41:52,799 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:41:52,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:41:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:41:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:41:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:41:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:41:52,801 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2019-08-04 21:41:52,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:52,801 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:41:52,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:41:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:41:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:41:52,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:52,801 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:41:52,801 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:52,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:52,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1860194208, now seen corresponding path program 74 times [2019-08-04 21:41:52,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:52,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:41:52,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:55,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:55,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:41:55,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:41:55,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:41:55,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:41:55,016 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 77 states. [2019-08-04 21:41:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:58,831 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-04 21:41:58,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:41:58,832 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:41:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:58,833 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:41:58,833 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:41:58,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:41:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:41:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:41:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:41:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:41:58,835 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2019-08-04 21:41:58,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:58,836 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:41:58,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:41:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:41:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:41:58,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:58,837 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:41:58,837 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1831453270, now seen corresponding path program 75 times [2019-08-04 21:41:58,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:58,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:41:58,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:01,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:01,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:42:01,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:42:01,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:42:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:42:01,098 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 78 states. [2019-08-04 21:42:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:05,777 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-04 21:42:05,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:42:05,778 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:42:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:05,779 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:42:05,779 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:42:05,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:42:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:42:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:42:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:42:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-04 21:42:05,781 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-08-04 21:42:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:05,781 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-04 21:42:05,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:42:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-04 21:42:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:42:05,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:05,782 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:42:05,782 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:05,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:05,782 INFO L82 PathProgramCache]: Analyzing trace with hash 940484192, now seen corresponding path program 76 times [2019-08-04 21:42:05,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:05,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:42:05,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:10,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:10,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:10,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:42:10,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:42:10,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:42:10,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:42:10,720 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 79 states. [2019-08-04 21:42:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:14,721 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-04 21:42:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:42:14,721 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-04 21:42:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:14,722 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:42:14,722 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:42:14,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:42:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:42:14,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:42:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:42:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-04 21:42:14,725 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2019-08-04 21:42:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:14,725 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-04 21:42:14,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:42:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-04 21:42:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:42:14,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:14,725 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-04 21:42:14,725 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:14,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:14,726 INFO L82 PathProgramCache]: Analyzing trace with hash -909753450, now seen corresponding path program 77 times [2019-08-04 21:42:14,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:14,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:42:14,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:17,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:17,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:42:17,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:42:17,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:42:17,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:42:17,300 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 80 states. [2019-08-04 21:42:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:21,190 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-04 21:42:21,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:42:21,191 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-04 21:42:21,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:21,191 INFO L225 Difference]: With dead ends: 84 [2019-08-04 21:42:21,192 INFO L226 Difference]: Without dead ends: 84 [2019-08-04 21:42:21,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:42:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-04 21:42:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-04 21:42:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-04 21:42:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-04 21:42:21,195 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2019-08-04 21:42:21,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:21,195 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-04 21:42:21,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:42:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-04 21:42:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-04 21:42:21,196 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:21,196 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-04 21:42:21,197 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:21,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:21,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1862421792, now seen corresponding path program 78 times [2019-08-04 21:42:21,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:21,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:42:21,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:23,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:23,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:42:23,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:42:23,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:42:23,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:42:23,918 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 81 states. [2019-08-04 21:42:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:28,063 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-04 21:42:28,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:42:28,063 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-04 21:42:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:28,064 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:42:28,064 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:42:28,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:42:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:42:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:42:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:42:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-04 21:42:28,067 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-08-04 21:42:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:28,067 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-04 21:42:28,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:42:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-04 21:42:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:42:28,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:28,068 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-04 21:42:28,068 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:28,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:28,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1900508374, now seen corresponding path program 79 times [2019-08-04 21:42:28,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:28,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-04 21:42:28,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:30,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:30,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:42:30,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:42:30,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:42:30,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:42:30,553 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 82 states. [2019-08-04 21:42:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:34,874 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-04 21:42:34,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:42:34,874 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-04 21:42:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:34,875 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:42:34,875 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:42:34,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:42:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:42:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-04 21:42:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-04 21:42:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-04 21:42:34,877 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2019-08-04 21:42:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:34,878 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-04 21:42:34,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:42:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-04 21:42:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-04 21:42:34,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:34,878 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-04 21:42:34,879 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:34,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:34,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1213774880, now seen corresponding path program 80 times [2019-08-04 21:42:34,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:34,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:42:34,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:38,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:38,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:42:38,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:42:38,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:42:38,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:42:38,623 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 83 states. [2019-08-04 21:42:42,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:42,898 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-04 21:42:42,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-04 21:42:42,898 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-04 21:42:42,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:42,899 INFO L225 Difference]: With dead ends: 87 [2019-08-04 21:42:42,899 INFO L226 Difference]: Without dead ends: 87 [2019-08-04 21:42:42,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:42:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-04 21:42:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-04 21:42:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-04 21:42:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-04 21:42:42,902 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2019-08-04 21:42:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:42,902 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-04 21:42:42,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-04 21:42:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-04 21:42:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:42:42,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:42,903 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-04 21:42:42,904 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:42,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:42,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1027692054, now seen corresponding path program 81 times [2019-08-04 21:42:42,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:42,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:42:42,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:45,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:45,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:42:45,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:42:45,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:42:45,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:42:45,446 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 84 states. [2019-08-04 21:42:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:49,990 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-04 21:42:49,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:42:49,991 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-04 21:42:49,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:49,992 INFO L225 Difference]: With dead ends: 88 [2019-08-04 21:42:49,992 INFO L226 Difference]: Without dead ends: 88 [2019-08-04 21:42:49,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:42:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-04 21:42:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-04 21:42:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-04 21:42:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-04 21:42:49,994 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-08-04 21:42:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:49,995 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-04 21:42:49,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:42:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-04 21:42:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-04 21:42:49,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:49,996 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-04 21:42:49,996 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:49,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:49,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1793690272, now seen corresponding path program 82 times [2019-08-04 21:42:49,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:50,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-04 21:42:50,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:52,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:52,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-04 21:42:52,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-04 21:42:52,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-04 21:42:52,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:42:52,917 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 85 states. [2019-08-04 21:42:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:57,339 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-04 21:42:57,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-04 21:42:57,339 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-04 21:42:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:57,340 INFO L225 Difference]: With dead ends: 89 [2019-08-04 21:42:57,340 INFO L226 Difference]: Without dead ends: 89 [2019-08-04 21:42:57,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:42:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-04 21:42:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-04 21:42:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-04 21:42:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-04 21:42:57,343 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2019-08-04 21:42:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:57,344 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-04 21:42:57,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-04 21:42:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-04 21:42:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-04 21:42:57,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:57,345 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-04 21:42:57,345 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:57,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:57,345 INFO L82 PathProgramCache]: Analyzing trace with hash -230168746, now seen corresponding path program 83 times [2019-08-04 21:42:57,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:57,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:42:57,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:00,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:00,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-04 21:43:00,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-04 21:43:00,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-04 21:43:00,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:43:00,263 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 86 states. [2019-08-04 21:43:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:05,107 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-04 21:43:05,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-04 21:43:05,108 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-04 21:43:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:05,109 INFO L225 Difference]: With dead ends: 90 [2019-08-04 21:43:05,109 INFO L226 Difference]: Without dead ends: 90 [2019-08-04 21:43:05,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:43:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-04 21:43:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-04 21:43:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-04 21:43:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-04 21:43:05,111 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2019-08-04 21:43:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:05,111 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-04 21:43:05,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-04 21:43:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-04 21:43:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-04 21:43:05,112 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:05,112 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-04 21:43:05,112 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:05,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1454711136, now seen corresponding path program 84 times [2019-08-04 21:43:05,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:05,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:43:05,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:07,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:07,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-04 21:43:07,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-04 21:43:07,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-04 21:43:07,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:43:07,995 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 87 states. [2019-08-04 21:43:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:12,617 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-04 21:43:12,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-04 21:43:12,618 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-04 21:43:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:12,618 INFO L225 Difference]: With dead ends: 91 [2019-08-04 21:43:12,618 INFO L226 Difference]: Without dead ends: 91 [2019-08-04 21:43:12,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:43:12,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-04 21:43:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-04 21:43:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-04 21:43:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-04 21:43:12,620 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-08-04 21:43:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:12,621 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-04 21:43:12,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-04 21:43:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-04 21:43:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-04 21:43:12,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:12,622 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-04 21:43:12,622 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:12,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:12,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2146379926, now seen corresponding path program 85 times [2019-08-04 21:43:12,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:12,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-04 21:43:12,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:15,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:15,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-04 21:43:15,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-04 21:43:15,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-04 21:43:15,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:43:15,652 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 88 states. [2019-08-04 21:43:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:20,631 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-04 21:43:20,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-04 21:43:20,632 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-04 21:43:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:20,632 INFO L225 Difference]: With dead ends: 92 [2019-08-04 21:43:20,633 INFO L226 Difference]: Without dead ends: 92 [2019-08-04 21:43:20,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:43:20,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-04 21:43:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-04 21:43:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-04 21:43:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-04 21:43:20,636 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2019-08-04 21:43:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:20,636 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-04 21:43:20,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-04 21:43:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-04 21:43:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-04 21:43:20,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:20,637 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-04 21:43:20,637 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:20,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2113275936, now seen corresponding path program 86 times [2019-08-04 21:43:20,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:20,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:43:20,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-04 21:43:22,887 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-04 21:43:22,887 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:43:22,891 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:43:22,891 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:43:22 BoogieIcfgContainer [2019-08-04 21:43:22,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:43:22,893 INFO L168 Benchmark]: Toolchain (without parser) took 242819.37 ms. Allocated memory was 134.7 MB in the beginning and 249.6 MB in the end (delta: 114.8 MB). Free memory was 111.1 MB in the beginning and 34.1 MB in the end (delta: 77.0 MB). Peak memory consumption was 191.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:43:22,894 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.7 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:43:22,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.08 ms. Allocated memory is still 134.7 MB. Free memory was 111.1 MB in the beginning and 109.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:43:22,895 INFO L168 Benchmark]: Boogie Preprocessor took 20.65 ms. Allocated memory is still 134.7 MB. Free memory was 109.0 MB in the beginning and 108.1 MB in the end (delta: 909.9 kB). Peak memory consumption was 909.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:43:22,896 INFO L168 Benchmark]: RCFGBuilder took 415.85 ms. Allocated memory is still 134.7 MB. Free memory was 107.7 MB in the beginning and 97.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:43:22,896 INFO L168 Benchmark]: TraceAbstraction took 242344.17 ms. Allocated memory was 134.7 MB in the beginning and 249.6 MB in the end (delta: 114.8 MB). Free memory was 97.5 MB in the beginning and 34.1 MB in the end (delta: 63.3 MB). Peak memory consumption was 178.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:43:22,899 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.7 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.08 ms. Allocated memory is still 134.7 MB. Free memory was 111.1 MB in the beginning and 109.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.65 ms. Allocated memory is still 134.7 MB. Free memory was 109.0 MB in the beginning and 108.1 MB in the end (delta: 909.9 kB). Peak memory consumption was 909.9 kB. Max. memory is 7.1 GB. * RCFGBuilder took 415.85 ms. Allocated memory is still 134.7 MB. Free memory was 107.7 MB in the beginning and 97.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242344.17 ms. Allocated memory was 134.7 MB in the beginning and 249.6 MB in the end (delta: 114.8 MB). Free memory was 97.5 MB in the beginning and 34.1 MB in the end (delta: 63.3 MB). Peak memory consumption was 178.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 25). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 86,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 24). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 86,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. TIMEOUT Result, 242.2s OverallTime, 87 OverallIterations, 86 TraceHistogramMax, 119.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 431 SDtfs, 0 SDslu, 8275 SDs, 0 SdLazy, 176755 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 98.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3827 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3741 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 115.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 86 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 118.0s InterpolantComputationTime, 3913 NumberOfCodeBlocks, 3913 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 3827 ConstructedInterpolants, 0 QuantifiedInterpolants, 662243 SizeOfPredicates, 136 NumberOfNonLiveVariables, 7998 ConjunctsInSsa, 3862 ConjunctsInUnsatCore, 86 InterpolantComputations, 1 PerfectInterpolantSequences, 0/105995 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown