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/scalable/CounterLoop-nBit.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:51:39,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:51:39,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:51:39,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:51:39,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:51:39,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:51:39,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:51:39,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:51:39,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:51:39,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:51:39,721 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:51:39,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:51:39,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:51:39,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:51:39,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:51:39,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:51:39,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:51:39,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:51:39,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:51:39,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:51:39,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:51:39,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:51:39,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:51:39,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:51:39,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:51:39,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:51:39,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:51:39,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:51:39,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:51:39,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:51:39,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:51:39,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:51:39,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:51:39,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:51:39,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:51:39,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:51:39,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:51:39,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:51:39,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:51:39,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:51:39,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:51:39,809 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:51:39,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:51:39,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:51:39,825 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:51:39,826 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:51:39,827 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CounterLoop-nBit.bpl [2019-08-05 10:51:39,827 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CounterLoop-nBit.bpl' [2019-08-05 10:51:39,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:51:39,860 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:51:39,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:51:39,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:51:39,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:51:39,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:51:39" (1/1) ... [2019-08-05 10:51:39,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:51:39" (1/1) ... [2019-08-05 10:51:39,893 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:51:39,893 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:51:39,893 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:51:39,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:51:39,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:51:39,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:51:39,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:51:39,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:51:39" (1/1) ... [2019-08-05 10:51:39,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:51:39" (1/1) ... [2019-08-05 10:51:39,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:51:39" (1/1) ... [2019-08-05 10:51:39,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:51:39" (1/1) ... [2019-08-05 10:51:39,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:51:39" (1/1) ... [2019-08-05 10:51:39,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:51:39" (1/1) ... [2019-08-05 10:51:39,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:51:39" (1/1) ... [2019-08-05 10:51:39,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:51:39,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:51:39,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:51:39,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:51:39,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:51:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:51:39,986 INFO L124 BoogieDeclarations]: Specification and implementation of procedure nBitCounter given in one single declaration [2019-08-05 10:51:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure nBitCounter [2019-08-05 10:51:39,986 INFO L138 BoogieDeclarations]: Found implementation of procedure nBitCounter [2019-08-05 10:51:40,340 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:51:40,340 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:51:40,342 INFO L202 PluginConnector]: Adding new model CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:51:40 BoogieIcfgContainer [2019-08-05 10:51:40,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:51:40,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:51:40,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:51:40,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:51:40,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:51:39" (1/2) ... [2019-08-05 10:51:40,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ebda4c and model type CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:51:40, skipping insertion in model container [2019-08-05 10:51:40,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:51:40" (2/2) ... [2019-08-05 10:51:40,350 INFO L109 eAbstractionObserver]: Analyzing ICFG CounterLoop-nBit.bpl [2019-08-05 10:51:40,359 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:51:40,365 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:51:40,383 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:51:40,407 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:51:40,408 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:51:40,408 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:51:40,409 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:51:40,409 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:51:40,409 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:51:40,409 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:51:40,409 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:51:40,410 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:51:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-08-05 10:51:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:51:40,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:40,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:51:40,434 INFO L418 AbstractCegarLoop]: === Iteration 1 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:40,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:40,440 INFO L82 PathProgramCache]: Analyzing trace with hash 28843710, now seen corresponding path program 1 times [2019-08-05 10:51:40,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:40,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:51:40,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:40,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:40,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:51:40,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:51:40,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:51:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:51:40,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:51:40,630 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-08-05 10:51:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:40,744 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-08-05 10:51:40,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:51:40,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 10:51:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:40,759 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:51:40,759 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:51:40,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:51:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:51:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:51:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:51:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-08-05 10:51:40,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 5 [2019-08-05 10:51:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:40,796 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-08-05 10:51:40,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:51:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-08-05 10:51:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:51:40,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:40,797 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:40,798 INFO L418 AbstractCegarLoop]: === Iteration 2 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:40,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:40,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2132322128, now seen corresponding path program 1 times [2019-08-05 10:51:40,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:40,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:51:40,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:40,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:40,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:51:40,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:51:40,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:51:40,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:51:40,959 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 4 states. [2019-08-05 10:51:41,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:41,015 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-08-05 10:51:41,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:51:41,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-08-05 10:51:41,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:41,016 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:51:41,016 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:51:41,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:51:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:51:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:51:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:51:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 10:51:41,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2019-08-05 10:51:41,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:41,021 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 10:51:41,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:51:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 10:51:41,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:51:41,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:41,022 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:41,022 INFO L418 AbstractCegarLoop]: === Iteration 3 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:41,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:41,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1022665110, now seen corresponding path program 2 times [2019-08-05 10:51:41,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:41,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:51:41,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:51:41,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:51:41,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:51:41,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:51:41,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:51:41,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:51:41,146 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 5 states. [2019-08-05 10:51:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:41,424 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-08-05 10:51:41,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:51:41,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-08-05 10:51:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:41,428 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:51:41,429 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:51:41,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:51:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:51:41,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-08-05 10:51:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:51:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-08-05 10:51:41,440 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2019-08-05 10:51:41,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:41,440 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-08-05 10:51:41,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:51:41,441 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2019-08-05 10:51:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:51:41,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:41,441 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:41,442 INFO L418 AbstractCegarLoop]: === Iteration 4 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:41,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1213354382, now seen corresponding path program 1 times [2019-08-05 10:51:41,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:41,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:51:41,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:41,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:41,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:51:41,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:51:41,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:51:41,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:51:41,580 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 5 states. [2019-08-05 10:51:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:41,622 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-08-05 10:51:41,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:51:41,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-08-05 10:51:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:41,623 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:51:41,623 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:51:41,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:51:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:51:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:51:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:51:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-08-05 10:51:41,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 15 [2019-08-05 10:51:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:41,629 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-08-05 10:51:41,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:51:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-08-05 10:51:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:51:41,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:41,630 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:41,630 INFO L418 AbstractCegarLoop]: === Iteration 5 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:41,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1909237864, now seen corresponding path program 2 times [2019-08-05 10:51:41,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:41,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:51:41,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:41,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:41,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:51:41,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:51:41,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:51:41,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:51:41,842 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 6 states. [2019-08-05 10:51:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:41,969 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2019-08-05 10:51:41,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:51:41,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-08-05 10:51:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:41,970 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:51:41,970 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:51:41,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:51:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:51:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:51:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:51:41,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-08-05 10:51:41,974 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 16 [2019-08-05 10:51:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:41,975 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-08-05 10:51:41,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:51:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2019-08-05 10:51:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:51:41,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:41,977 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:41,977 INFO L418 AbstractCegarLoop]: === Iteration 6 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2006789326, now seen corresponding path program 3 times [2019-08-05 10:51:41,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:42,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:51:42,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:42,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:42,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:51:42,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:51:42,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:51:42,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:51:42,148 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 7 states. [2019-08-05 10:51:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:42,193 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-08-05 10:51:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:51:42,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-08-05 10:51:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:42,195 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:51:42,195 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:51:42,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:51:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:51:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:51:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:51:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-08-05 10:51:42,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 17 [2019-08-05 10:51:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:42,201 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-08-05 10:51:42,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:51:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-08-05 10:51:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:51:42,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:42,202 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:42,202 INFO L418 AbstractCegarLoop]: === Iteration 7 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash -735917352, now seen corresponding path program 4 times [2019-08-05 10:51:42,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:42,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:51:42,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:42,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:42,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:51:42,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:51:42,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:51:42,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:51:42,379 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 8 states. [2019-08-05 10:51:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:42,634 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2019-08-05 10:51:42,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:51:42,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-08-05 10:51:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:42,635 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:51:42,635 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:51:42,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:51:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:51:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:51:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:51:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-08-05 10:51:42,639 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 18 [2019-08-05 10:51:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:42,639 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-08-05 10:51:42,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:51:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2019-08-05 10:51:42,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:51:42,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:42,641 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:42,641 INFO L418 AbstractCegarLoop]: === Iteration 8 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:42,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:42,641 INFO L82 PathProgramCache]: Analyzing trace with hash 6408178, now seen corresponding path program 5 times [2019-08-05 10:51:42,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:42,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:51:42,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:42,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:42,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:51:42,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:51:42,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:51:42,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:51:42,916 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 9 states. [2019-08-05 10:51:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:42,969 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-08-05 10:51:42,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:51:42,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-08-05 10:51:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:42,972 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:51:42,972 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:51:42,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:51:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:51:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:51:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:51:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-08-05 10:51:42,976 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 19 [2019-08-05 10:51:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:42,977 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-08-05 10:51:42,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:51:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2019-08-05 10:51:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:51:42,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:42,978 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:42,978 INFO L418 AbstractCegarLoop]: === Iteration 9 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:42,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:42,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1543663128, now seen corresponding path program 6 times [2019-08-05 10:51:42,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:42,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:51:42,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:43,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:43,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:51:43,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:51:43,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:51:43,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:51:43,196 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 10 states. [2019-08-05 10:51:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:43,278 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-08-05 10:51:43,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:51:43,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-08-05 10:51:43,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:43,280 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:51:43,280 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:51:43,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:51:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:51:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:51:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:51:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-08-05 10:51:43,286 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 20 [2019-08-05 10:51:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:43,287 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-08-05 10:51:43,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:51:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-08-05 10:51:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:51:43,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:43,287 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:43,288 INFO L418 AbstractCegarLoop]: === Iteration 10 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:43,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:43,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1953926322, now seen corresponding path program 7 times [2019-08-05 10:51:43,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:43,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:51:43,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:43,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:43,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:51:43,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:51:43,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:51:43,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:51:43,488 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 11 states. [2019-08-05 10:51:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:43,593 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-08-05 10:51:43,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:51:43,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-08-05 10:51:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:43,594 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:51:43,594 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:51:43,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:51:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:51:43,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:51:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:51:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-08-05 10:51:43,598 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 21 [2019-08-05 10:51:43,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:43,598 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-08-05 10:51:43,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:51:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2019-08-05 10:51:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:51:43,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:43,600 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:43,600 INFO L418 AbstractCegarLoop]: === Iteration 11 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:43,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1787183448, now seen corresponding path program 8 times [2019-08-05 10:51:43,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:43,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:51:43,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:43,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:43,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:51:43,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:51:43,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:51:43,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:51:43,985 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 12 states. [2019-08-05 10:51:44,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:44,043 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-08-05 10:51:44,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:51:44,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-08-05 10:51:44,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:44,045 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:51:44,045 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:51:44,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:51:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:51:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:51:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:51:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-08-05 10:51:44,049 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 22 [2019-08-05 10:51:44,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:44,050 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-08-05 10:51:44,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:51:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-08-05 10:51:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:51:44,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:44,051 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:44,051 INFO L418 AbstractCegarLoop]: === Iteration 12 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:44,051 INFO L82 PathProgramCache]: Analyzing trace with hash 913121650, now seen corresponding path program 9 times [2019-08-05 10:51:44,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:44,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:51:44,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:44,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:44,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:51:44,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:51:44,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:51:44,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:51:44,244 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 13 states. [2019-08-05 10:51:44,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:44,296 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-08-05 10:51:44,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:51:44,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-08-05 10:51:44,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:44,297 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:51:44,298 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:51:44,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:51:44,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:51:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:51:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:51:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-08-05 10:51:44,302 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 23 [2019-08-05 10:51:44,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:44,303 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-08-05 10:51:44,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:51:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2019-08-05 10:51:44,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:51:44,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:44,304 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:44,304 INFO L418 AbstractCegarLoop]: === Iteration 13 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:44,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:44,305 INFO L82 PathProgramCache]: Analyzing trace with hash -412990312, now seen corresponding path program 10 times [2019-08-05 10:51:44,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:44,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:51:44,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:44,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:44,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:51:44,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:51:44,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:51:44,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:51:44,529 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 14 states. [2019-08-05 10:51:44,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:44,616 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-08-05 10:51:44,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:51:44,616 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-08-05 10:51:44,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:44,617 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:51:44,617 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:51:44,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:51:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:51:44,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:51:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:51:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-08-05 10:51:44,621 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 24 [2019-08-05 10:51:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:44,621 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-08-05 10:51:44,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:51:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-08-05 10:51:44,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:51:44,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:44,622 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:44,622 INFO L418 AbstractCegarLoop]: === Iteration 14 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:44,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:44,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1427211826, now seen corresponding path program 11 times [2019-08-05 10:51:44,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:44,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:51:44,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:45,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:45,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:51:45,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:51:45,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:51:45,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:51:45,063 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 15 states. [2019-08-05 10:51:45,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:45,146 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-08-05 10:51:45,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:51:45,147 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-08-05 10:51:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:45,147 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:51:45,148 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:51:45,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 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-05 10:51:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:51:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:51:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:51:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-08-05 10:51:45,152 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 25 [2019-08-05 10:51:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:45,152 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-08-05 10:51:45,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:51:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2019-08-05 10:51:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:51:45,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:45,153 INFO L399 BasicCegarLoop]: trace histogram [13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:45,154 INFO L418 AbstractCegarLoop]: === Iteration 15 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:45,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:45,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1656064040, now seen corresponding path program 12 times [2019-08-05 10:51:45,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:45,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:51:45,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:45,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:45,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:51:45,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:51:45,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:51:45,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:51:45,524 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 16 states. [2019-08-05 10:51:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:45,838 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-08-05 10:51:45,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:51:45,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 10:51:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:45,839 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:51:45,840 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:51:45,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:51:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:51:45,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:51:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:51:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-08-05 10:51:45,846 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 26 [2019-08-05 10:51:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:45,847 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-08-05 10:51:45,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:51:45,847 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-08-05 10:51:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:51:45,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:45,848 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:45,848 INFO L418 AbstractCegarLoop]: === Iteration 16 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:45,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:45,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1546631922, now seen corresponding path program 13 times [2019-08-05 10:51:45,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:45,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:51:45,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:46,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:46,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:51:46,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:51:46,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:51:46,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:51:46,206 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 17 states. [2019-08-05 10:51:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:46,285 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2019-08-05 10:51:46,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:51:46,286 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-08-05 10:51:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:46,287 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:51:46,287 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:51:46,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 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-05 10:51:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:51:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:51:46,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:51:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-08-05 10:51:46,292 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 27 [2019-08-05 10:51:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:46,292 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-08-05 10:51:46,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:51:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-08-05 10:51:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:51:46,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:46,293 INFO L399 BasicCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:46,294 INFO L418 AbstractCegarLoop]: === Iteration 17 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2045958936, now seen corresponding path program 14 times [2019-08-05 10:51:46,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:46,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:51:46,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:46,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:46,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:51:46,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:51:46,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:51:46,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:51:46,813 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 18 states. [2019-08-05 10:51:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:47,172 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-08-05 10:51:47,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:51:47,173 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2019-08-05 10:51:47,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:47,174 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:51:47,174 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:51:47,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 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-05 10:51:47,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:51:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:51:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:51:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-08-05 10:51:47,179 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 28 [2019-08-05 10:51:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:47,179 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-08-05 10:51:47,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:51:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-08-05 10:51:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:51:47,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:47,180 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:47,180 INFO L418 AbstractCegarLoop]: === Iteration 18 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:47,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:47,181 INFO L82 PathProgramCache]: Analyzing trace with hash 345227186, now seen corresponding path program 15 times [2019-08-05 10:51:47,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:47,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:51:47,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:47,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:47,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:51:47,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:51:47,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:51:47,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:51:47,454 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 19 states. [2019-08-05 10:51:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:47,492 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-08-05 10:51:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:51:47,493 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-08-05 10:51:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:47,494 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:51:47,494 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:51:47,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:51:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:51:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:51:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:51:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-08-05 10:51:47,497 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 29 [2019-08-05 10:51:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:47,497 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-08-05 10:51:47,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:51:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-08-05 10:51:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:51:47,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:47,498 INFO L399 BasicCegarLoop]: trace histogram [17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:47,498 INFO L418 AbstractCegarLoop]: === Iteration 19 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:47,499 INFO L82 PathProgramCache]: Analyzing trace with hash -837849512, now seen corresponding path program 16 times [2019-08-05 10:51:47,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:47,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:51:47,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:47,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:47,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:51:47,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:51:47,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:51:47,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:51:47,875 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 20 states. [2019-08-05 10:51:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:47,942 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2019-08-05 10:51:47,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:51:47,943 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-08-05 10:51:47,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:47,943 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:51:47,943 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:51:47,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:51:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:51:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:51:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:51:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-08-05 10:51:47,947 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 30 [2019-08-05 10:51:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:47,947 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-08-05 10:51:47,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:51:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-08-05 10:51:47,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:51:47,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:47,948 INFO L399 BasicCegarLoop]: trace histogram [18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:47,948 INFO L418 AbstractCegarLoop]: === Iteration 20 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:47,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1141478514, now seen corresponding path program 17 times [2019-08-05 10:51:47,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:47,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:51:47,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:48,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:48,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:51:48,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:51:48,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:51:48,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:51:48,410 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 21 states. [2019-08-05 10:51:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:48,448 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-08-05 10:51:48,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:51:48,448 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-08-05 10:51:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:48,449 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:51:48,449 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:51:48,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:51:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:51:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:51:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:51:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-08-05 10:51:48,453 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 31 [2019-08-05 10:51:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:48,454 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-08-05 10:51:48,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:51:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2019-08-05 10:51:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:51:48,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:48,455 INFO L399 BasicCegarLoop]: trace histogram [19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:48,455 INFO L418 AbstractCegarLoop]: === Iteration 21 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:48,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1923862120, now seen corresponding path program 18 times [2019-08-05 10:51:48,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:48,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:51:48,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:48,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:48,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:51:48,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:51:48,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:51:48,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:51:48,756 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 22 states. [2019-08-05 10:51:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:48,826 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-08-05 10:51:48,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:51:48,826 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-08-05 10:51:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:48,827 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:51:48,827 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:51:48,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:51:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:51:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:51:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:51:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-08-05 10:51:48,833 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 32 [2019-08-05 10:51:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:48,833 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-08-05 10:51:48,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:51:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-08-05 10:51:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:51:48,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:48,834 INFO L399 BasicCegarLoop]: trace histogram [20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:48,835 INFO L418 AbstractCegarLoop]: === Iteration 22 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:48,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:48,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1834826034, now seen corresponding path program 19 times [2019-08-05 10:51:48,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:48,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:51:48,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:49,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:49,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:51:49,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:51:49,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:51:49,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:51:49,328 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 23 states. [2019-08-05 10:51:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:49,493 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-08-05 10:51:49,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:51:49,495 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2019-08-05 10:51:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:49,496 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:51:49,496 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:51:49,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:51:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:51:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:51:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:51:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-08-05 10:51:49,499 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 33 [2019-08-05 10:51:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:49,499 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-08-05 10:51:49,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:51:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-08-05 10:51:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:51:49,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:49,500 INFO L399 BasicCegarLoop]: trace histogram [21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:49,500 INFO L418 AbstractCegarLoop]: === Iteration 23 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:49,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:49,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1904925480, now seen corresponding path program 20 times [2019-08-05 10:51:49,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:49,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:51:49,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:50,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:50,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:51:50,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:51:50,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:51:50,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:51:50,364 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 24 states. [2019-08-05 10:51:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:50,521 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2019-08-05 10:51:50,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:51:50,522 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2019-08-05 10:51:50,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:50,522 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:51:50,522 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:51:50,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:51:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:51:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:51:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:51:50,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-08-05 10:51:50,525 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 34 [2019-08-05 10:51:50,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:50,525 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-08-05 10:51:50,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:51:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-08-05 10:51:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:51:50,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:50,526 INFO L399 BasicCegarLoop]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:50,526 INFO L418 AbstractCegarLoop]: === Iteration 24 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:50,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1873105422, now seen corresponding path program 21 times [2019-08-05 10:51:50,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:50,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:51:50,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:50,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:50,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:51:50,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:51:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:51:50,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:51:50,910 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 25 states. [2019-08-05 10:51:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:50,989 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-08-05 10:51:50,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:51:50,990 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-08-05 10:51:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:50,990 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:51:50,991 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:51:50,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:51:50,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:51:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:51:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:51:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-08-05 10:51:50,995 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 35 [2019-08-05 10:51:50,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:50,995 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-08-05 10:51:50,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:51:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2019-08-05 10:51:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:51:50,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:50,996 INFO L399 BasicCegarLoop]: trace histogram [23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:50,996 INFO L418 AbstractCegarLoop]: === Iteration 25 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:50,997 INFO L82 PathProgramCache]: Analyzing trace with hash -886683624, now seen corresponding path program 22 times [2019-08-05 10:51:50,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:51,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:51:51,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:51,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:51,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:51:51,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:51:51,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:51:51,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:51:51,408 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 26 states. [2019-08-05 10:51:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:51,470 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-08-05 10:51:51,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:51:51,470 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-08-05 10:51:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:51,471 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:51:51,471 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:51:51,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:51:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:51:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:51:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:51:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2019-08-05 10:51:51,475 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 36 [2019-08-05 10:51:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:51,475 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-08-05 10:51:51,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:51:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2019-08-05 10:51:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:51:51,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:51,476 INFO L399 BasicCegarLoop]: trace histogram [24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:51,476 INFO L418 AbstractCegarLoop]: === Iteration 26 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:51,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:51,476 INFO L82 PathProgramCache]: Analyzing trace with hash -372378958, now seen corresponding path program 23 times [2019-08-05 10:51:51,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:51,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:51:51,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:52,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:52,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:51:52,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:51:52,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:51:52,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:51:52,261 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 27 states. [2019-08-05 10:51:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:52,315 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-08-05 10:51:52,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:51:52,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-08-05 10:51:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:52,316 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:51:52,316 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:51:52,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:51:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:51:52,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:51:52,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:51:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-08-05 10:51:52,320 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 37 [2019-08-05 10:51:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:52,320 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-08-05 10:51:52,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:51:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-08-05 10:51:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:51:52,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:52,320 INFO L399 BasicCegarLoop]: trace histogram [25, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:52,321 INFO L418 AbstractCegarLoop]: === Iteration 27 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:52,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1608803496, now seen corresponding path program 24 times [2019-08-05 10:51:52,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:52,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:51:52,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:54,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:54,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:51:54,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:51:54,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:51:54,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:51:54,087 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 28 states. [2019-08-05 10:51:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:54,184 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-08-05 10:51:54,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:51:54,184 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2019-08-05 10:51:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:54,185 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:51:54,185 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:51:54,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:51:54,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:51:54,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:51:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:51:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-08-05 10:51:54,188 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 38 [2019-08-05 10:51:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:54,189 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-08-05 10:51:54,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:51:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-08-05 10:51:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:51:54,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:54,189 INFO L399 BasicCegarLoop]: trace histogram [26, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:54,190 INFO L418 AbstractCegarLoop]: === Iteration 28 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:54,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:54,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1283258510, now seen corresponding path program 25 times [2019-08-05 10:51:54,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:54,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:51:54,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:54,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:54,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:51:54,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:51:54,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:51:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:51:54,760 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 29 states. [2019-08-05 10:51:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:54,835 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-08-05 10:51:54,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:51:54,835 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2019-08-05 10:51:54,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:54,836 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:51:54,836 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:51:54,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:51:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:51:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:51:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:51:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-08-05 10:51:54,843 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 39 [2019-08-05 10:51:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:54,843 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-08-05 10:51:54,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:51:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-08-05 10:51:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:51:54,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:54,843 INFO L399 BasicCegarLoop]: trace histogram [27, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:54,844 INFO L418 AbstractCegarLoop]: === Iteration 29 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:54,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash 218701464, now seen corresponding path program 26 times [2019-08-05 10:51:54,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:54,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:51:54,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:56,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:56,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:51:56,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:51:56,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:51:56,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:51:56,857 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 30 states. [2019-08-05 10:51:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:56,953 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-08-05 10:51:56,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:51:56,953 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2019-08-05 10:51:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:56,954 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:51:56,954 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:51:56,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:51:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:51:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:51:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:51:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-08-05 10:51:56,958 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 40 [2019-08-05 10:51:56,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:56,958 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-08-05 10:51:56,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:51:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-08-05 10:51:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:51:56,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:56,959 INFO L399 BasicCegarLoop]: trace histogram [28, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:56,959 INFO L418 AbstractCegarLoop]: === Iteration 30 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:56,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:56,960 INFO L82 PathProgramCache]: Analyzing trace with hash -465179598, now seen corresponding path program 27 times [2019-08-05 10:51:56,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:56,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:51:56,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:57,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:57,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:51:57,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:51:57,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:51:57,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:51:57,530 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 31 states. [2019-08-05 10:51:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:57,621 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-08-05 10:51:57,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:51:57,622 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2019-08-05 10:51:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:57,623 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:51:57,623 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:51:57,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:51:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:51:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:51:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:51:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-08-05 10:51:57,626 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 41 [2019-08-05 10:51:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:57,626 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-08-05 10:51:57,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:51:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-08-05 10:51:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:51:57,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:57,627 INFO L399 BasicCegarLoop]: trace histogram [29, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:57,627 INFO L418 AbstractCegarLoop]: === Iteration 31 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:57,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:57,627 INFO L82 PathProgramCache]: Analyzing trace with hash -190656040, now seen corresponding path program 28 times [2019-08-05 10:51:57,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:57,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:51:57,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:58,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:58,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:51:58,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:51:58,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:51:58,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:51:58,187 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 32 states. [2019-08-05 10:51:58,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:58,293 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-08-05 10:51:58,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:51:58,293 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2019-08-05 10:51:58,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:58,294 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:51:58,294 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:51:58,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:51:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:51:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:51:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:51:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-08-05 10:51:58,297 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 42 [2019-08-05 10:51:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:58,297 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-08-05 10:51:58,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:51:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-08-05 10:51:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:51:58,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:58,298 INFO L399 BasicCegarLoop]: trace histogram [30, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:58,298 INFO L418 AbstractCegarLoop]: === Iteration 32 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:58,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:58,298 INFO L82 PathProgramCache]: Analyzing trace with hash -270360334, now seen corresponding path program 29 times [2019-08-05 10:51:58,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:58,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:51:58,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:59,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:59,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:51:59,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:51:59,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:51:59,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:51:59,045 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 33 states. [2019-08-05 10:51:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:59,218 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-08-05 10:51:59,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:51:59,218 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2019-08-05 10:51:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:59,218 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:51:59,219 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:51:59,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:51:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:51:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:51:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:51:59,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-08-05 10:51:59,221 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 43 [2019-08-05 10:51:59,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:59,221 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-08-05 10:51:59,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:51:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-08-05 10:51:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:51:59,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:59,222 INFO L399 BasicCegarLoop]: trace histogram [31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:59,222 INFO L418 AbstractCegarLoop]: === Iteration 33 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:59,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:59,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1553773848, now seen corresponding path program 30 times [2019-08-05 10:51:59,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:59,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:51:59,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:51:59,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:59,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:51:59,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:51:59,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:51:59,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:51:59,790 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 34 states. [2019-08-05 10:51:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:59,862 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-08-05 10:51:59,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:51:59,863 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 44 [2019-08-05 10:51:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:59,863 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:51:59,864 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:51:59,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:51:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:51:59,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:51:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:51:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-08-05 10:51:59,867 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 44 [2019-08-05 10:51:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:59,867 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-08-05 10:51:59,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:51:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-08-05 10:51:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:51:59,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:59,868 INFO L399 BasicCegarLoop]: trace histogram [32, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:51:59,868 INFO L418 AbstractCegarLoop]: === Iteration 34 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:59,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:59,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2027608654, now seen corresponding path program 31 times [2019-08-05 10:51:59,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:59,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:51:59,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:00,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:00,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:52:00,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:52:00,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:52:00,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:52:00,794 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 35 states. [2019-08-05 10:52:00,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:00,872 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-08-05 10:52:00,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:52:00,873 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2019-08-05 10:52:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:00,873 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:52:00,874 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:52:00,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:52:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:52:00,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:52:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:52:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-08-05 10:52:00,877 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 45 [2019-08-05 10:52:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:00,877 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-08-05 10:52:00,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:52:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-08-05 10:52:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:52:00,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:00,877 INFO L399 BasicCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:00,878 INFO L418 AbstractCegarLoop]: === Iteration 35 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:00,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:00,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1381316520, now seen corresponding path program 32 times [2019-08-05 10:52:00,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:00,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:52:00,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:01,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:01,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:52:01,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:52:01,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:52:01,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:52:01,492 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 36 states. [2019-08-05 10:52:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:01,593 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-08-05 10:52:01,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:52:01,594 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2019-08-05 10:52:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:01,595 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:52:01,595 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:52:01,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:52:01,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:52:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:52:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:52:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-08-05 10:52:01,598 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 46 [2019-08-05 10:52:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:01,598 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-08-05 10:52:01,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:52:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-08-05 10:52:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:52:01,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:01,599 INFO L399 BasicCegarLoop]: trace histogram [34, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:01,599 INFO L418 AbstractCegarLoop]: === Iteration 36 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:01,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:01,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1473870450, now seen corresponding path program 33 times [2019-08-05 10:52:01,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:01,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:52:01,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:02,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:02,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:52:02,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:52:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:52:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:52:02,316 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 37 states. [2019-08-05 10:52:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:02,392 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-08-05 10:52:02,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:52:02,393 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2019-08-05 10:52:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:02,394 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:52:02,394 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:52:02,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:52:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:52:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:52:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:52:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2019-08-05 10:52:02,397 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 47 [2019-08-05 10:52:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:02,397 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2019-08-05 10:52:02,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:52:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2019-08-05 10:52:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:52:02,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:02,398 INFO L399 BasicCegarLoop]: trace histogram [35, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:02,398 INFO L418 AbstractCegarLoop]: === Iteration 37 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:02,398 INFO L82 PathProgramCache]: Analyzing trace with hash -209646696, now seen corresponding path program 34 times [2019-08-05 10:52:02,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:02,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:52:02,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:03,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:03,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:52:03,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:52:03,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:52:03,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:52:03,281 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 38 states. [2019-08-05 10:52:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:03,362 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-08-05 10:52:03,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:52:03,362 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 48 [2019-08-05 10:52:03,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:03,363 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:52:03,363 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:52:03,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:52:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:52:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:52:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:52:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-08-05 10:52:03,366 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 48 [2019-08-05 10:52:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:03,367 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-08-05 10:52:03,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:52:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-08-05 10:52:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:52:03,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:03,367 INFO L399 BasicCegarLoop]: trace histogram [36, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:03,368 INFO L418 AbstractCegarLoop]: === Iteration 38 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:03,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:03,368 INFO L82 PathProgramCache]: Analyzing trace with hash -859070670, now seen corresponding path program 35 times [2019-08-05 10:52:03,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:03,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:52:03,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:04,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:04,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:52:04,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:52:04,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:52:04,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:52:04,163 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 39 states. [2019-08-05 10:52:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:04,272 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-08-05 10:52:04,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:52:04,272 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 49 [2019-08-05 10:52:04,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:04,273 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:52:04,273 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:52:04,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:52:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:52:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:52:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:52:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-08-05 10:52:04,276 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 49 [2019-08-05 10:52:04,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:04,276 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-08-05 10:52:04,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:52:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-08-05 10:52:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:52:04,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:04,277 INFO L399 BasicCegarLoop]: trace histogram [37, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:04,277 INFO L418 AbstractCegarLoop]: === Iteration 39 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:04,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:04,278 INFO L82 PathProgramCache]: Analyzing trace with hash 483622616, now seen corresponding path program 36 times [2019-08-05 10:52:04,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:04,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:52:04,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:05,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:05,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:52:05,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:52:05,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:52:05,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:52:05,640 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 40 states. [2019-08-05 10:52:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:05,726 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-08-05 10:52:05,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:52:05,727 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2019-08-05 10:52:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:05,728 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:52:05,728 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:52:05,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:52:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:52:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:52:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:52:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2019-08-05 10:52:05,732 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 50 [2019-08-05 10:52:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:05,732 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2019-08-05 10:52:05,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:52:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2019-08-05 10:52:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:52:05,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:05,733 INFO L399 BasicCegarLoop]: trace histogram [38, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:05,733 INFO L418 AbstractCegarLoop]: === Iteration 40 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:05,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:05,734 INFO L82 PathProgramCache]: Analyzing trace with hash -842558478, now seen corresponding path program 37 times [2019-08-05 10:52:05,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:05,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:52:05,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:06,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:06,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:52:06,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:52:06,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:52:06,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:52:06,636 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 41 states. [2019-08-05 10:52:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:06,759 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-08-05 10:52:06,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:52:06,760 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 51 [2019-08-05 10:52:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:06,761 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:52:06,761 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:52:06,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:52:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:52:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:52:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:52:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-08-05 10:52:06,765 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 51 [2019-08-05 10:52:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:06,765 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-08-05 10:52:06,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:52:06,765 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-08-05 10:52:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:52:06,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:06,766 INFO L399 BasicCegarLoop]: trace histogram [39, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:06,766 INFO L418 AbstractCegarLoop]: === Iteration 41 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:06,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:06,767 INFO L82 PathProgramCache]: Analyzing trace with hash 995500568, now seen corresponding path program 38 times [2019-08-05 10:52:06,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:06,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:52:06,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:07,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:07,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:52:07,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:52:07,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:52:07,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:52:07,764 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 42 states. [2019-08-05 10:52:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:07,870 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-08-05 10:52:07,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:52:07,871 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 52 [2019-08-05 10:52:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:07,872 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:52:07,872 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:52:07,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:52:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:52:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:52:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:52:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-08-05 10:52:07,875 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 52 [2019-08-05 10:52:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:07,875 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2019-08-05 10:52:07,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:52:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2019-08-05 10:52:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:52:07,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:07,876 INFO L399 BasicCegarLoop]: trace histogram [40, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:07,876 INFO L418 AbstractCegarLoop]: === Iteration 42 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:07,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2140756146, now seen corresponding path program 39 times [2019-08-05 10:52:07,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:07,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:52:07,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:08,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:08,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:52:08,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:52:08,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:52:08,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:52:08,789 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 43 states. [2019-08-05 10:52:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:08,891 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-08-05 10:52:08,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:52:08,892 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 53 [2019-08-05 10:52:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:08,892 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:52:08,893 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:52:08,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:52:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:52:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:52:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:52:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-08-05 10:52:08,896 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 53 [2019-08-05 10:52:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:08,896 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-08-05 10:52:08,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:52:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-08-05 10:52:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:52:08,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:08,897 INFO L399 BasicCegarLoop]: trace histogram [41, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:08,897 INFO L418 AbstractCegarLoop]: === Iteration 43 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:08,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:08,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1011026600, now seen corresponding path program 40 times [2019-08-05 10:52:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:08,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:52:08,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:09,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:09,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:52:09,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:52:09,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:52:09,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:52:09,868 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 44 states. [2019-08-05 10:52:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:10,163 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2019-08-05 10:52:10,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:52:10,164 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2019-08-05 10:52:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:10,165 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:52:10,165 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:52:10,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:52:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:52:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:52:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:52:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2019-08-05 10:52:10,169 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 54 [2019-08-05 10:52:10,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:10,169 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2019-08-05 10:52:10,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:52:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2019-08-05 10:52:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:52:10,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:10,169 INFO L399 BasicCegarLoop]: trace histogram [42, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:10,170 INFO L418 AbstractCegarLoop]: === Iteration 44 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:10,170 INFO L82 PathProgramCache]: Analyzing trace with hash 67956082, now seen corresponding path program 41 times [2019-08-05 10:52:10,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:10,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:52:10,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:11,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:11,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:52:11,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:52:11,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:52:11,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:52:11,392 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 45 states. [2019-08-05 10:52:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:11,551 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-08-05 10:52:11,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:52:11,551 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 55 [2019-08-05 10:52:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:11,552 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:52:11,552 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:52:11,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:52:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:52:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:52:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:52:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2019-08-05 10:52:11,555 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 55 [2019-08-05 10:52:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:11,556 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2019-08-05 10:52:11,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:52:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2019-08-05 10:52:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:52:11,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:11,556 INFO L399 BasicCegarLoop]: trace histogram [43, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:11,556 INFO L418 AbstractCegarLoop]: === Iteration 45 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:11,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash -843319144, now seen corresponding path program 42 times [2019-08-05 10:52:11,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:11,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:52:11,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:12,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:12,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:52:12,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:52:12,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:52:12,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:52:12,555 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 46 states. [2019-08-05 10:52:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:12,690 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2019-08-05 10:52:12,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:52:12,690 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 56 [2019-08-05 10:52:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:12,691 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:52:12,691 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:52:12,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:52:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:52:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:52:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:52:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2019-08-05 10:52:12,695 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 56 [2019-08-05 10:52:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:12,695 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2019-08-05 10:52:12,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:52:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2019-08-05 10:52:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:52:12,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:12,696 INFO L399 BasicCegarLoop]: trace histogram [44, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:12,696 INFO L418 AbstractCegarLoop]: === Iteration 46 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash 971919922, now seen corresponding path program 43 times [2019-08-05 10:52:12,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:12,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:52:12,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:13,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:13,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:52:13,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:52:13,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:52:13,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:52:13,777 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 47 states. [2019-08-05 10:52:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:14,080 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2019-08-05 10:52:14,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:52:14,080 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 57 [2019-08-05 10:52:14,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:14,081 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:52:14,081 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:52:14,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:52:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:52:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:52:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:52:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2019-08-05 10:52:14,084 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 57 [2019-08-05 10:52:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:14,084 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2019-08-05 10:52:14,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:52:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2019-08-05 10:52:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:52:14,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:14,085 INFO L399 BasicCegarLoop]: trace histogram [45, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:14,085 INFO L418 AbstractCegarLoop]: === Iteration 47 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1409756120, now seen corresponding path program 44 times [2019-08-05 10:52:14,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:14,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:52:14,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:15,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:15,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:52:15,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:52:15,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:52:15,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:52:15,457 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 48 states. [2019-08-05 10:52:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:15,628 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2019-08-05 10:52:15,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:52:15,629 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 58 [2019-08-05 10:52:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:15,629 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:52:15,629 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:52:15,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:52:15,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:52:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:52:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:52:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2019-08-05 10:52:15,632 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 58 [2019-08-05 10:52:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:15,632 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2019-08-05 10:52:15,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:52:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2019-08-05 10:52:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:52:15,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:15,633 INFO L399 BasicCegarLoop]: trace histogram [46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:15,633 INFO L418 AbstractCegarLoop]: === Iteration 48 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:15,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2097776370, now seen corresponding path program 45 times [2019-08-05 10:52:15,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:15,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:52:15,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:16,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:16,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:52:16,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:52:16,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:52:16,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:52:16,799 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 49 states. [2019-08-05 10:52:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:16,917 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-08-05 10:52:16,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:52:16,917 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 59 [2019-08-05 10:52:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:16,918 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:52:16,918 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:52:16,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:52:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:52:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:52:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:52:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-08-05 10:52:16,922 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 59 [2019-08-05 10:52:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:16,922 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-08-05 10:52:16,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:52:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-08-05 10:52:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:52:16,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:16,923 INFO L399 BasicCegarLoop]: trace histogram [47, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:16,923 INFO L418 AbstractCegarLoop]: === Iteration 49 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:16,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:16,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1951567640, now seen corresponding path program 46 times [2019-08-05 10:52:16,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:16,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:52:16,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:18,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:18,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:52:18,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:52:18,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:52:18,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:52:18,240 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 50 states. [2019-08-05 10:52:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:18,328 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-08-05 10:52:18,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:52:18,329 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 60 [2019-08-05 10:52:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:18,330 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:52:18,330 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:52:18,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:52:18,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:52:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:52:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:52:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2019-08-05 10:52:18,333 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 60 [2019-08-05 10:52:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:18,333 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2019-08-05 10:52:18,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:52:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2019-08-05 10:52:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:52:18,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:18,334 INFO L399 BasicCegarLoop]: trace histogram [48, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:18,334 INFO L418 AbstractCegarLoop]: === Iteration 50 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:18,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:18,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1714064306, now seen corresponding path program 47 times [2019-08-05 10:52:18,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:18,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:52:18,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:19,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:19,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:52:19,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:52:19,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:52:19,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:52:19,742 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 51 states. [2019-08-05 10:52:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:19,832 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-08-05 10:52:19,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:52:19,832 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 61 [2019-08-05 10:52:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:19,833 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:52:19,833 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:52:19,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:52:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:52:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:52:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:52:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-08-05 10:52:19,836 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 61 [2019-08-05 10:52:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:19,837 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-08-05 10:52:19,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:52:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-08-05 10:52:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:52:19,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:19,838 INFO L399 BasicCegarLoop]: trace histogram [49, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:19,838 INFO L418 AbstractCegarLoop]: === Iteration 51 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:19,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:19,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1353571752, now seen corresponding path program 48 times [2019-08-05 10:52:19,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:19,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:52:19,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1229 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:21,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:21,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:52:21,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:52:21,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:52:21,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:52:21,538 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 52 states. [2019-08-05 10:52:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:21,718 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2019-08-05 10:52:21,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:52:21,718 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 62 [2019-08-05 10:52:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:21,719 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:52:21,720 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:52:21,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:52:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:52:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:52:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:52:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2019-08-05 10:52:21,722 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 62 [2019-08-05 10:52:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:21,722 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2019-08-05 10:52:21,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:52:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2019-08-05 10:52:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:52:21,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:21,723 INFO L399 BasicCegarLoop]: trace histogram [50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:21,723 INFO L418 AbstractCegarLoop]: === Iteration 52 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:21,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:21,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1961009038, now seen corresponding path program 49 times [2019-08-05 10:52:21,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:21,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:52:21,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:23,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:23,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:52:23,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:52:23,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:52:23,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:52:23,321 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 53 states. [2019-08-05 10:52:23,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:23,475 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2019-08-05 10:52:23,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:52:23,476 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 63 [2019-08-05 10:52:23,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:23,476 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:52:23,477 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:52:23,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:52:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:52:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:52:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:52:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-08-05 10:52:23,479 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 63 [2019-08-05 10:52:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:23,479 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-08-05 10:52:23,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:52:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-08-05 10:52:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:52:23,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:23,480 INFO L399 BasicCegarLoop]: trace histogram [51, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:23,480 INFO L418 AbstractCegarLoop]: === Iteration 53 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:23,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:23,480 INFO L82 PathProgramCache]: Analyzing trace with hash 683271576, now seen corresponding path program 50 times [2019-08-05 10:52:23,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:23,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:52:23,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:24,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:24,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:52:24,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:52:24,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:52:24,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:52:24,846 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 54 states. [2019-08-05 10:52:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:25,019 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2019-08-05 10:52:25,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:52:25,019 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 64 [2019-08-05 10:52:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:25,020 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:52:25,020 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:52:25,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:52:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:52:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:52:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:52:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-08-05 10:52:25,023 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 64 [2019-08-05 10:52:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:25,023 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-08-05 10:52:25,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:52:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-08-05 10:52:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:52:25,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:25,024 INFO L399 BasicCegarLoop]: trace histogram [52, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:25,024 INFO L418 AbstractCegarLoop]: === Iteration 54 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:25,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1051591986, now seen corresponding path program 51 times [2019-08-05 10:52:25,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:25,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:52:25,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:26,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:26,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:52:26,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:52:26,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:52:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:52:26,689 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 55 states. [2019-08-05 10:52:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:26,844 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2019-08-05 10:52:26,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:52:26,845 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 65 [2019-08-05 10:52:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:26,846 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:52:26,846 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:52:26,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:52:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:52:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:52:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:52:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2019-08-05 10:52:26,849 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 65 [2019-08-05 10:52:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:26,849 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2019-08-05 10:52:26,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:52:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2019-08-05 10:52:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:52:26,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:26,850 INFO L399 BasicCegarLoop]: trace histogram [53, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:26,851 INFO L418 AbstractCegarLoop]: === Iteration 55 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:26,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash -415377192, now seen corresponding path program 52 times [2019-08-05 10:52:26,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:26,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:52:26,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:28,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:28,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:52:28,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:52:28,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:52:28,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:52:28,388 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 56 states. [2019-08-05 10:52:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:28,565 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2019-08-05 10:52:28,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:52:28,566 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 66 [2019-08-05 10:52:28,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:28,567 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:52:28,567 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:52:28,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:52:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:52:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:52:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:52:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-08-05 10:52:28,570 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 66 [2019-08-05 10:52:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:28,570 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-08-05 10:52:28,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:52:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-08-05 10:52:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:52:28,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:28,571 INFO L399 BasicCegarLoop]: trace histogram [54, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:28,571 INFO L418 AbstractCegarLoop]: === Iteration 56 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:28,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:28,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1353218546, now seen corresponding path program 53 times [2019-08-05 10:52:28,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:28,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:52:28,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1489 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:30,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:30,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:52:30,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:52:30,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:52:30,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:52:30,490 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 57 states. [2019-08-05 10:52:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:30,664 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2019-08-05 10:52:30,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:52:30,665 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 67 [2019-08-05 10:52:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:30,666 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:52:30,666 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:52:30,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:52:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:52:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:52:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:52:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2019-08-05 10:52:30,668 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 67 [2019-08-05 10:52:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:30,669 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2019-08-05 10:52:30,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:52:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2019-08-05 10:52:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:52:30,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:30,669 INFO L399 BasicCegarLoop]: trace histogram [55, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:30,669 INFO L418 AbstractCegarLoop]: === Iteration 57 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:30,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:30,670 INFO L82 PathProgramCache]: Analyzing trace with hash 345111576, now seen corresponding path program 54 times [2019-08-05 10:52:30,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:30,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:52:30,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:32,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:32,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:52:32,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:52:32,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:52:32,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:52:32,420 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 58 states. [2019-08-05 10:52:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:32,605 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2019-08-05 10:52:32,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:52:32,606 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 68 [2019-08-05 10:52:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:32,607 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:52:32,607 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:52:32,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:52:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:52:32,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:52:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:52:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2019-08-05 10:52:32,610 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 68 [2019-08-05 10:52:32,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:32,610 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2019-08-05 10:52:32,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:52:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2019-08-05 10:52:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:52:32,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:32,610 INFO L399 BasicCegarLoop]: trace histogram [56, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:32,611 INFO L418 AbstractCegarLoop]: === Iteration 58 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:32,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:32,611 INFO L82 PathProgramCache]: Analyzing trace with hash -841433422, now seen corresponding path program 55 times [2019-08-05 10:52:32,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:32,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:52:32,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:34,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:34,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:52:34,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:52:34,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:52:34,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:52:34,753 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 59 states. [2019-08-05 10:52:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:34,847 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-08-05 10:52:34,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:52:34,848 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 69 [2019-08-05 10:52:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:34,849 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:52:34,849 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:52:34,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:52:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:52:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:52:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:52:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2019-08-05 10:52:34,852 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 69 [2019-08-05 10:52:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:34,853 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2019-08-05 10:52:34,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:52:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2019-08-05 10:52:34,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:52:34,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:34,853 INFO L399 BasicCegarLoop]: trace histogram [57, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:34,854 INFO L418 AbstractCegarLoop]: === Iteration 59 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1030377304, now seen corresponding path program 56 times [2019-08-05 10:52:34,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:34,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:52:34,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1657 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:36,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:36,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:52:36,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:52:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:52:36,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:52:36,776 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 60 states. [2019-08-05 10:52:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:36,895 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-08-05 10:52:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:52:36,895 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 70 [2019-08-05 10:52:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:36,897 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:52:36,897 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:52:36,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:52:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:52:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:52:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:52:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-08-05 10:52:36,899 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 70 [2019-08-05 10:52:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:36,900 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-08-05 10:52:36,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:52:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-08-05 10:52:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:52:36,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:36,901 INFO L399 BasicCegarLoop]: trace histogram [58, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:36,901 INFO L418 AbstractCegarLoop]: === Iteration 60 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1073032334, now seen corresponding path program 57 times [2019-08-05 10:52:36,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:36,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:52:36,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1715 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:38,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:38,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:52:38,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:52:38,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:52:38,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:52:38,617 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 61 states. [2019-08-05 10:52:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:39,463 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-08-05 10:52:39,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:52:39,464 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 71 [2019-08-05 10:52:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:39,465 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:52:39,465 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:52:39,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:52:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:52:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:52:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:52:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-08-05 10:52:39,469 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 71 [2019-08-05 10:52:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:39,469 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-08-05 10:52:39,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:52:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-08-05 10:52:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:52:39,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:39,470 INFO L399 BasicCegarLoop]: trace histogram [59, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:39,470 INFO L418 AbstractCegarLoop]: === Iteration 61 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1854221672, now seen corresponding path program 58 times [2019-08-05 10:52:39,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:39,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:52:39,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:41,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:41,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:52:41,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:52:41,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:52:41,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:52:41,532 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 62 states. [2019-08-05 10:52:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:41,723 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-08-05 10:52:41,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:52:41,724 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 72 [2019-08-05 10:52:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:41,725 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:52:41,725 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:52:41,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:52:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:52:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:52:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:52:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2019-08-05 10:52:41,729 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 72 [2019-08-05 10:52:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:41,729 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2019-08-05 10:52:41,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:52:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2019-08-05 10:52:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:52:41,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:41,730 INFO L399 BasicCegarLoop]: trace histogram [60, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:41,730 INFO L418 AbstractCegarLoop]: === Iteration 62 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash -301287374, now seen corresponding path program 59 times [2019-08-05 10:52:41,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:41,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:52:41,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1834 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:43,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:43,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:52:43,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:52:43,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:52:43,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:52:43,477 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 63 states. [2019-08-05 10:52:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:44,388 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2019-08-05 10:52:44,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:52:44,388 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 73 [2019-08-05 10:52:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:44,389 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:52:44,389 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:52:44,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:52:44,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:52:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:52:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:52:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-08-05 10:52:44,393 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 73 [2019-08-05 10:52:44,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:44,393 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-08-05 10:52:44,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:52:44,394 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-08-05 10:52:44,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:52:44,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:44,394 INFO L399 BasicCegarLoop]: trace histogram [61, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:44,395 INFO L418 AbstractCegarLoop]: === Iteration 63 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:44,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:44,395 INFO L82 PathProgramCache]: Analyzing trace with hash 595035608, now seen corresponding path program 60 times [2019-08-05 10:52:44,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:44,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:52:44,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1895 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:46,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:46,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:52:46,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:52:46,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:52:46,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:52:46,709 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 64 states. [2019-08-05 10:52:46,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:46,892 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2019-08-05 10:52:46,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:52:46,893 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 74 [2019-08-05 10:52:46,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:46,894 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:52:46,894 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:52:46,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:52:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:52:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:52:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:52:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2019-08-05 10:52:46,898 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 74 [2019-08-05 10:52:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:46,898 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2019-08-05 10:52:46,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:52:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2019-08-05 10:52:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:52:46,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:46,899 INFO L399 BasicCegarLoop]: trace histogram [62, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:46,899 INFO L418 AbstractCegarLoop]: === Iteration 64 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:46,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:46,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1683723022, now seen corresponding path program 61 times [2019-08-05 10:52:46,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:46,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:52:46,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:48,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:48,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:52:48,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:52:48,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:52:48,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:52:48,750 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 65 states. [2019-08-05 10:52:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:48,862 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-08-05 10:52:48,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:52:48,863 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 75 [2019-08-05 10:52:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:48,864 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:52:48,864 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:52:48,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:52:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:52:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:52:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:52:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2019-08-05 10:52:48,867 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 75 [2019-08-05 10:52:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:48,867 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2019-08-05 10:52:48,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:52:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2019-08-05 10:52:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:52:48,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:48,868 INFO L399 BasicCegarLoop]: trace histogram [63, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:48,868 INFO L418 AbstractCegarLoop]: === Iteration 65 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash 689203480, now seen corresponding path program 62 times [2019-08-05 10:52:48,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:48,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:52:48,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:50,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:50,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:52:50,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:52:50,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:52:50,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:52:50,850 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 66 states. [2019-08-05 10:52:51,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:51,182 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-08-05 10:52:51,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:52:51,182 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 76 [2019-08-05 10:52:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:51,182 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:52:51,183 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:52:51,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:52:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:52:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:52:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:52:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2019-08-05 10:52:51,185 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 76 [2019-08-05 10:52:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:51,185 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2019-08-05 10:52:51,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:52:51,185 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2019-08-05 10:52:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:52:51,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:51,186 INFO L399 BasicCegarLoop]: trace histogram [64, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:51,186 INFO L418 AbstractCegarLoop]: === Iteration 66 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:51,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:51,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1235481010, now seen corresponding path program 63 times [2019-08-05 10:52:51,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:51,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:52:51,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2084 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:53,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:53,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:52:53,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:52:53,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:52:53,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:52:53,354 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 67 states. [2019-08-05 10:52:53,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:53,471 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-08-05 10:52:53,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:52:53,471 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 77 [2019-08-05 10:52:53,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:53,472 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:52:53,472 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:52:53,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:52:53,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:52:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:52:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:52:53,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2019-08-05 10:52:53,475 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 77 [2019-08-05 10:52:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:53,476 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2019-08-05 10:52:53,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:52:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2019-08-05 10:52:53,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:52:53,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:53,476 INFO L399 BasicCegarLoop]: trace histogram [65, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:53,476 INFO L418 AbstractCegarLoop]: === Iteration 67 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:53,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:53,477 INFO L82 PathProgramCache]: Analyzing trace with hash 990215256, now seen corresponding path program 64 times [2019-08-05 10:52:53,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:53,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:52:53,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2149 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:55,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:55,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:52:55,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:52:55,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:52:55,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:52:55,455 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 68 states. [2019-08-05 10:52:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:55,669 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-08-05 10:52:55,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:52:55,670 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 78 [2019-08-05 10:52:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:55,671 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:52:55,671 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:52:55,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:52:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:52:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:52:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:52:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2019-08-05 10:52:55,673 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 78 [2019-08-05 10:52:55,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:55,674 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2019-08-05 10:52:55,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:52:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2019-08-05 10:52:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:52:55,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:55,675 INFO L399 BasicCegarLoop]: trace histogram [66, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:55,675 INFO L418 AbstractCegarLoop]: === Iteration 68 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:55,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1976911474, now seen corresponding path program 65 times [2019-08-05 10:52:55,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:55,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:52:55,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2215 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:58,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:58,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:52:58,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:52:58,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:52:58,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:52:58,380 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 69 states. [2019-08-05 10:52:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:58,546 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2019-08-05 10:52:58,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:52:58,547 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 79 [2019-08-05 10:52:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:58,548 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:52:58,548 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:52:58,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:52:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:52:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:52:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:52:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2019-08-05 10:52:58,551 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 79 [2019-08-05 10:52:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:58,551 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2019-08-05 10:52:58,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:52:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2019-08-05 10:52:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:52:58,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:58,552 INFO L399 BasicCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:52:58,552 INFO L418 AbstractCegarLoop]: === Iteration 69 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:58,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1795244136, now seen corresponding path program 66 times [2019-08-05 10:52:58,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:58,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:52:58,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:00,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:00,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:53:00,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:53:00,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:53:00,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:53:00,666 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 70 states. [2019-08-05 10:53:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:00,782 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2019-08-05 10:53:00,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:53:00,783 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 80 [2019-08-05 10:53:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:00,784 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:53:00,784 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:53:00,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:53:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:53:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:53:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:53:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2019-08-05 10:53:00,787 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 80 [2019-08-05 10:53:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:00,787 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2019-08-05 10:53:00,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:53:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2019-08-05 10:53:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:53:00,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:00,788 INFO L399 BasicCegarLoop]: trace histogram [68, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:00,789 INFO L418 AbstractCegarLoop]: === Iteration 70 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:00,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:00,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1527016242, now seen corresponding path program 67 times [2019-08-05 10:53:00,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:00,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:53:00,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:03,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:03,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:53:03,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:53:03,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:53:03,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:53:03,444 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 71 states. [2019-08-05 10:53:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:03,651 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2019-08-05 10:53:03,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:53:03,651 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 81 [2019-08-05 10:53:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:03,652 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:53:03,652 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:53:03,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:53:03,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:53:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:53:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:53:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2019-08-05 10:53:03,654 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 81 [2019-08-05 10:53:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:03,654 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2019-08-05 10:53:03,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:53:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2019-08-05 10:53:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:53:03,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:03,655 INFO L399 BasicCegarLoop]: trace histogram [69, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:03,655 INFO L418 AbstractCegarLoop]: === Iteration 71 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:03,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1437872856, now seen corresponding path program 68 times [2019-08-05 10:53:03,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:03,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:53:03,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2419 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:05,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:05,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:53:05,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:53:05,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:53:05,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:53:05,896 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 72 states. [2019-08-05 10:53:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:06,076 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2019-08-05 10:53:06,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:53:06,077 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 82 [2019-08-05 10:53:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:06,078 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:53:06,078 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:53:06,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:53:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:53:06,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:53:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:53:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2019-08-05 10:53:06,081 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 82 [2019-08-05 10:53:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:06,081 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2019-08-05 10:53:06,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:53:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2019-08-05 10:53:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:53:06,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:06,082 INFO L399 BasicCegarLoop]: trace histogram [70, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:06,082 INFO L418 AbstractCegarLoop]: === Iteration 72 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:06,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1325572110, now seen corresponding path program 69 times [2019-08-05 10:53:06,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:06,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:53:06,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2489 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:08,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:08,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:53:08,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:53:08,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:53:08,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:53:08,651 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 73 states. [2019-08-05 10:53:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:08,815 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-08-05 10:53:08,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:53:08,815 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 83 [2019-08-05 10:53:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:08,816 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:53:08,816 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:53:08,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:53:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:53:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:53:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:53:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2019-08-05 10:53:08,820 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 83 [2019-08-05 10:53:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:08,820 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2019-08-05 10:53:08,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:53:08,821 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2019-08-05 10:53:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:53:08,821 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:08,821 INFO L399 BasicCegarLoop]: trace histogram [71, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:08,821 INFO L418 AbstractCegarLoop]: === Iteration 73 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1093020136, now seen corresponding path program 70 times [2019-08-05 10:53:08,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:08,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:53:08,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2560 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:12,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:12,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:53:12,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:53:12,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:53:12,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:53:12,244 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 74 states. [2019-08-05 10:53:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:12,400 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2019-08-05 10:53:12,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:53:12,400 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 84 [2019-08-05 10:53:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:12,401 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:53:12,402 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:53:12,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:53:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:53:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:53:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:53:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-08-05 10:53:12,404 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 84 [2019-08-05 10:53:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:12,405 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-08-05 10:53:12,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:53:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-08-05 10:53:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:53:12,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:12,406 INFO L399 BasicCegarLoop]: trace histogram [72, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:12,406 INFO L418 AbstractCegarLoop]: === Iteration 74 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:12,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:12,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1821123762, now seen corresponding path program 71 times [2019-08-05 10:53:12,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:12,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:53:12,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2632 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:16,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:16,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:53:16,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:53:16,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:53:16,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:53:16,413 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 75 states. [2019-08-05 10:53:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:16,565 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2019-08-05 10:53:16,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:53:16,566 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 85 [2019-08-05 10:53:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:16,567 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:53:16,567 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:53:16,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:53:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:53:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:53:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:53:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2019-08-05 10:53:16,569 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 85 [2019-08-05 10:53:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:16,570 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2019-08-05 10:53:16,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:53:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2019-08-05 10:53:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:53:16,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:16,571 INFO L399 BasicCegarLoop]: trace histogram [73, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:16,571 INFO L418 AbstractCegarLoop]: === Iteration 75 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:16,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:16,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1965271384, now seen corresponding path program 72 times [2019-08-05 10:53:16,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:16,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:53:16,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2705 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:19,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:19,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:53:19,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:53:19,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:53:19,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:53:19,393 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 76 states. [2019-08-05 10:53:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:19,545 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2019-08-05 10:53:19,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:53:19,545 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 86 [2019-08-05 10:53:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:19,546 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:53:19,546 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:53:19,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:53:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:53:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:53:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:53:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2019-08-05 10:53:19,549 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 86 [2019-08-05 10:53:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:19,549 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2019-08-05 10:53:19,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:53:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2019-08-05 10:53:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:53:19,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:19,550 INFO L399 BasicCegarLoop]: trace histogram [74, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:19,551 INFO L418 AbstractCegarLoop]: === Iteration 76 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:19,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:19,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2138880370, now seen corresponding path program 73 times [2019-08-05 10:53:19,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:19,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:53:19,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:22,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2779 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:22,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:22,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:53:22,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:53:22,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:53:22,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:53:22,285 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 77 states. [2019-08-05 10:53:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:22,461 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-08-05 10:53:22,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:53:22,462 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 87 [2019-08-05 10:53:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:22,463 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:53:22,463 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:53:22,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:53:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:53:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:53:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:53:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-08-05 10:53:22,466 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 87 [2019-08-05 10:53:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:22,466 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-08-05 10:53:22,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:53:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-08-05 10:53:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:53:22,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:22,467 INFO L399 BasicCegarLoop]: trace histogram [75, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:22,467 INFO L418 AbstractCegarLoop]: === Iteration 77 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:22,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1069175656, now seen corresponding path program 74 times [2019-08-05 10:53:22,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:22,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:53:22,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2854 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:25,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:25,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:53:25,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:53:25,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:53:25,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:53:25,142 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 78 states. [2019-08-05 10:53:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:25,298 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-08-05 10:53:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:53:25,298 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 88 [2019-08-05 10:53:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:25,299 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:53:25,299 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:53:25,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:53:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:53:25,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:53:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:53:25,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-08-05 10:53:25,302 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 88 [2019-08-05 10:53:25,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:25,302 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-08-05 10:53:25,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:53:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-08-05 10:53:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:53:25,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:25,303 INFO L399 BasicCegarLoop]: trace histogram [76, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:25,303 INFO L418 AbstractCegarLoop]: === Iteration 78 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:25,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:25,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1734664654, now seen corresponding path program 75 times [2019-08-05 10:53:25,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:25,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:53:25,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2930 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:28,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:28,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:53:28,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:53:28,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:53:28,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:53:28,198 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 79 states. [2019-08-05 10:53:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:28,366 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-08-05 10:53:28,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:53:28,366 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 89 [2019-08-05 10:53:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:28,367 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:53:28,367 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:53:28,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:53:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:53:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:53:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:53:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2019-08-05 10:53:28,370 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 89 [2019-08-05 10:53:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:28,370 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2019-08-05 10:53:28,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:53:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2019-08-05 10:53:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:53:28,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:28,371 INFO L399 BasicCegarLoop]: trace histogram [77, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:28,371 INFO L418 AbstractCegarLoop]: === Iteration 79 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:28,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:28,371 INFO L82 PathProgramCache]: Analyzing trace with hash -889987112, now seen corresponding path program 76 times [2019-08-05 10:53:28,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:28,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:53:28,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3007 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:31,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:31,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:53:31,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:53:31,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:53:31,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:53:31,003 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 80 states. [2019-08-05 10:53:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:31,194 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-08-05 10:53:31,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:53:31,195 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 90 [2019-08-05 10:53:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:31,196 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:53:31,196 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:53:31,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:53:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:53:31,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:53:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:53:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-08-05 10:53:31,198 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 90 [2019-08-05 10:53:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:31,199 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-08-05 10:53:31,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:53:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-08-05 10:53:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:53:31,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:31,199 INFO L399 BasicCegarLoop]: trace histogram [78, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:31,200 INFO L418 AbstractCegarLoop]: === Iteration 80 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:31,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:31,200 INFO L82 PathProgramCache]: Analyzing trace with hash -474787086, now seen corresponding path program 77 times [2019-08-05 10:53:31,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:31,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:53:31,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3085 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:34,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:34,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:53:34,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:53:34,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:53:34,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:53:34,236 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 81 states. [2019-08-05 10:53:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:34,452 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-08-05 10:53:34,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:53:34,452 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 91 [2019-08-05 10:53:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:34,453 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:53:34,453 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:53:34,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:53:34,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:53:34,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:53:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:53:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2019-08-05 10:53:34,456 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 91 [2019-08-05 10:53:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:34,456 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2019-08-05 10:53:34,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:53:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2019-08-05 10:53:34,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:53:34,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:34,457 INFO L399 BasicCegarLoop]: trace histogram [79, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:34,457 INFO L418 AbstractCegarLoop]: === Iteration 81 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:34,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:34,457 INFO L82 PathProgramCache]: Analyzing trace with hash -488488168, now seen corresponding path program 78 times [2019-08-05 10:53:34,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:34,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:53:34,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:37,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:37,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:53:37,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:53:37,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:53:37,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:53:37,534 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 82 states. [2019-08-05 10:53:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:37,681 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2019-08-05 10:53:37,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:53:37,682 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 92 [2019-08-05 10:53:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:37,683 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:53:37,683 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:53:37,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:53:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:53:37,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:53:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:53:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2019-08-05 10:53:37,686 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 92 [2019-08-05 10:53:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:37,686 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2019-08-05 10:53:37,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:53:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2019-08-05 10:53:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:53:37,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:37,687 INFO L399 BasicCegarLoop]: trace histogram [80, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:37,687 INFO L418 AbstractCegarLoop]: === Iteration 82 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash -913221710, now seen corresponding path program 79 times [2019-08-05 10:53:37,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:37,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:53:37,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3244 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:40,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:40,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:53:40,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:53:40,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:53:40,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:53:40,549 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 83 states. [2019-08-05 10:53:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:40,728 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2019-08-05 10:53:40,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:53:40,728 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 93 [2019-08-05 10:53:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:40,729 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:53:40,729 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:53:40,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:53:40,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:53:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:53:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:53:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2019-08-05 10:53:40,732 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 93 [2019-08-05 10:53:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:40,732 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2019-08-05 10:53:40,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:53:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2019-08-05 10:53:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:53:40,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:40,733 INFO L399 BasicCegarLoop]: trace histogram [81, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:40,733 INFO L418 AbstractCegarLoop]: === Iteration 83 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:40,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:40,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1195059624, now seen corresponding path program 80 times [2019-08-05 10:53:40,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:40,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:53:40,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3325 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:43,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:43,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:53:43,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:53:43,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:53:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:53:43,791 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 84 states. [2019-08-05 10:53:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:44,015 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2019-08-05 10:53:44,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:53:44,016 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 94 [2019-08-05 10:53:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:44,017 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:53:44,017 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:53:44,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:53:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:53:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:53:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:53:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2019-08-05 10:53:44,020 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 94 [2019-08-05 10:53:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:44,020 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2019-08-05 10:53:44,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:53:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2019-08-05 10:53:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:53:44,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:44,021 INFO L399 BasicCegarLoop]: trace histogram [82, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:44,021 INFO L418 AbstractCegarLoop]: === Iteration 84 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1342100366, now seen corresponding path program 81 times [2019-08-05 10:53:44,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:44,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:53:44,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3407 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:47,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:47,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:53:47,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:53:47,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:53:47,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:53:47,466 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 85 states. [2019-08-05 10:53:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:47,711 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-08-05 10:53:47,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:53:47,712 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 95 [2019-08-05 10:53:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:47,712 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:53:47,712 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:53:47,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:53:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:53:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:53:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:53:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2019-08-05 10:53:47,714 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 95 [2019-08-05 10:53:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:47,714 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2019-08-05 10:53:47,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:53:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2019-08-05 10:53:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:53:47,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:47,715 INFO L399 BasicCegarLoop]: trace histogram [83, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:47,715 INFO L418 AbstractCegarLoop]: === Iteration 85 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:47,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1605396072, now seen corresponding path program 82 times [2019-08-05 10:53:47,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:47,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:53:47,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3490 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:51,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:51,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:53:51,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:53:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:53:51,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:53:51,179 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 86 states. [2019-08-05 10:53:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:51,477 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2019-08-05 10:53:51,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:53:51,478 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 96 [2019-08-05 10:53:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:51,478 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:53:51,479 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:53:51,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:53:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:53:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:53:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:53:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2019-08-05 10:53:51,482 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 96 [2019-08-05 10:53:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:51,482 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2019-08-05 10:53:51,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:53:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2019-08-05 10:53:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:53:51,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:51,483 INFO L399 BasicCegarLoop]: trace histogram [84, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:51,483 INFO L418 AbstractCegarLoop]: === Iteration 86 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:51,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:51,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1177628366, now seen corresponding path program 83 times [2019-08-05 10:53:51,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:51,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:53:51,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3574 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:55,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:55,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:53:55,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:53:55,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:53:55,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:53:55,003 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 87 states. [2019-08-05 10:53:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:55,152 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2019-08-05 10:53:55,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:53:55,153 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 97 [2019-08-05 10:53:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:55,154 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:53:55,154 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:53:55,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:53:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:53:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:53:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:53:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2019-08-05 10:53:55,157 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 97 [2019-08-05 10:53:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:55,157 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2019-08-05 10:53:55,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:53:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2019-08-05 10:53:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:53:55,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:55,158 INFO L399 BasicCegarLoop]: trace histogram [85, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:55,158 INFO L418 AbstractCegarLoop]: === Iteration 87 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:55,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:55,159 INFO L82 PathProgramCache]: Analyzing trace with hash -801731368, now seen corresponding path program 84 times [2019-08-05 10:53:55,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:55,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:53:55,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3659 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:58,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:58,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:53:58,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:53:58,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:53:58,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:53:58,695 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 88 states. [2019-08-05 10:53:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:59,000 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2019-08-05 10:53:59,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:53:59,000 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 98 [2019-08-05 10:53:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:59,001 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:53:59,001 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:53:59,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:53:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:53:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:53:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:53:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2019-08-05 10:53:59,004 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 98 [2019-08-05 10:53:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:59,004 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2019-08-05 10:53:59,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:53:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2019-08-05 10:53:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:53:59,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:59,005 INFO L399 BasicCegarLoop]: trace histogram [86, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:53:59,005 INFO L418 AbstractCegarLoop]: === Iteration 88 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:59,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:59,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2033826318, now seen corresponding path program 85 times [2019-08-05 10:53:59,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:59,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:53:59,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3745 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:02,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:02,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:54:02,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:54:02,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:54:02,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:54:02,272 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 89 states. [2019-08-05 10:54:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:02,435 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2019-08-05 10:54:02,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:54:02,436 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 99 [2019-08-05 10:54:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:02,437 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:54:02,437 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:54:02,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:54:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:54:02,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:54:02,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:54:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2019-08-05 10:54:02,440 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 99 [2019-08-05 10:54:02,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:02,441 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2019-08-05 10:54:02,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:54:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2019-08-05 10:54:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:54:02,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:02,441 INFO L399 BasicCegarLoop]: trace histogram [87, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:02,442 INFO L418 AbstractCegarLoop]: === Iteration 89 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:02,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:02,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1574064104, now seen corresponding path program 86 times [2019-08-05 10:54:02,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:02,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:54:02,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3832 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:05,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:05,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:54:05,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:54:05,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:54:05,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:54:05,992 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand 90 states. [2019-08-05 10:54:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:06,229 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2019-08-05 10:54:06,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:54:06,229 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 100 [2019-08-05 10:54:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:06,230 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:54:06,230 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:54:06,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:54:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:54:06,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:54:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:54:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-08-05 10:54:06,234 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 100 [2019-08-05 10:54:06,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:06,234 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-08-05 10:54:06,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:54:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-08-05 10:54:06,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:54:06,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:06,235 INFO L399 BasicCegarLoop]: trace histogram [88, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:06,235 INFO L418 AbstractCegarLoop]: === Iteration 90 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash -206337358, now seen corresponding path program 87 times [2019-08-05 10:54:06,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:06,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:54:06,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3920 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:09,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:09,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:54:09,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:54:09,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:54:09,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:54:09,915 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 91 states. [2019-08-05 10:54:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:10,123 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2019-08-05 10:54:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:54:10,124 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 101 [2019-08-05 10:54:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:10,125 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:54:10,125 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:54:10,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:54:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:54:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:54:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:54:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-08-05 10:54:10,128 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 101 [2019-08-05 10:54:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:10,129 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-08-05 10:54:10,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:54:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-08-05 10:54:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:54:10,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:10,129 INFO L399 BasicCegarLoop]: trace histogram [89, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:10,129 INFO L418 AbstractCegarLoop]: === Iteration 91 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:10,130 INFO L82 PathProgramCache]: Analyzing trace with hash -756481192, now seen corresponding path program 88 times [2019-08-05 10:54:10,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:10,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:54:10,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:13,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:13,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:54:13,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:54:13,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:54:13,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:54:13,843 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 92 states. [2019-08-05 10:54:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:14,017 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-08-05 10:54:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:54:14,017 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 102 [2019-08-05 10:54:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:14,018 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:54:14,018 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:54:14,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:54:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:54:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:54:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:54:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-08-05 10:54:14,022 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 102 [2019-08-05 10:54:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:14,022 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-08-05 10:54:14,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:54:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-08-05 10:54:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:54:14,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:14,023 INFO L399 BasicCegarLoop]: trace histogram [90, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:14,023 INFO L418 AbstractCegarLoop]: === Iteration 92 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:14,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:14,023 INFO L82 PathProgramCache]: Analyzing trace with hash -631070862, now seen corresponding path program 89 times [2019-08-05 10:54:14,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:14,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:54:14,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4099 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:17,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:17,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:54:17,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:54:17,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:54:17,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:54:17,699 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 93 states. [2019-08-05 10:54:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:17,857 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-08-05 10:54:17,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:54:17,858 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 103 [2019-08-05 10:54:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:17,859 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:54:17,859 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:54:17,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:54:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:54:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:54:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:54:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-08-05 10:54:17,862 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 103 [2019-08-05 10:54:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:17,862 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-08-05 10:54:17,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:54:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-08-05 10:54:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:54:17,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:17,863 INFO L399 BasicCegarLoop]: trace histogram [91, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:17,863 INFO L418 AbstractCegarLoop]: === Iteration 93 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:17,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1038317928, now seen corresponding path program 90 times [2019-08-05 10:54:17,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:17,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:54:17,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4190 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:21,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:21,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:54:21,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:54:21,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:54:21,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:54:21,814 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 94 states. [2019-08-05 10:54:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:22,053 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2019-08-05 10:54:22,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:54:22,053 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 104 [2019-08-05 10:54:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:22,054 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:54:22,054 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:54:22,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:54:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:54:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:54:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:54:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2019-08-05 10:54:22,057 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 104 [2019-08-05 10:54:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:22,058 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2019-08-05 10:54:22,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:54:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2019-08-05 10:54:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:54:22,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:22,059 INFO L399 BasicCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:22,059 INFO L418 AbstractCegarLoop]: === Iteration 94 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:22,059 INFO L82 PathProgramCache]: Analyzing trace with hash -778075086, now seen corresponding path program 91 times [2019-08-05 10:54:22,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:22,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:54:22,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4282 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:26,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:26,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:54:26,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:54:26,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:54:26,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:54:26,161 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 95 states. [2019-08-05 10:54:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:26,416 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2019-08-05 10:54:26,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:54:26,416 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 105 [2019-08-05 10:54:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:26,417 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:54:26,417 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:54:26,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:54:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:54:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:54:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:54:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-08-05 10:54:26,420 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 105 [2019-08-05 10:54:26,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:26,420 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-08-05 10:54:26,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:54:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-08-05 10:54:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:54:26,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:26,421 INFO L399 BasicCegarLoop]: trace histogram [93, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:26,422 INFO L418 AbstractCegarLoop]: === Iteration 95 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1300481576, now seen corresponding path program 92 times [2019-08-05 10:54:26,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:26,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:54:26,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:30,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:30,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:54:30,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:54:30,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:54:30,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:54:30,511 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 96 states. [2019-08-05 10:54:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:30,737 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-08-05 10:54:30,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:54:30,738 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 106 [2019-08-05 10:54:30,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:30,739 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:54:30,739 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:54:30,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:54:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:54:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:54:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:54:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2019-08-05 10:54:30,743 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 106 [2019-08-05 10:54:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:30,743 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2019-08-05 10:54:30,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:54:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2019-08-05 10:54:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:54:30,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:30,744 INFO L399 BasicCegarLoop]: trace histogram [94, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:30,744 INFO L418 AbstractCegarLoop]: === Iteration 96 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:30,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:30,744 INFO L82 PathProgramCache]: Analyzing trace with hash -315213582, now seen corresponding path program 93 times [2019-08-05 10:54:30,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:30,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:54:30,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4469 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:34,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:34,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:54:34,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:54:34,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:54:34,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:54:34,852 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 97 states. [2019-08-05 10:54:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:35,072 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2019-08-05 10:54:35,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:54:35,072 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 107 [2019-08-05 10:54:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:35,073 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:54:35,073 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:54:35,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:54:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:54:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:54:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:54:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-08-05 10:54:35,076 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 107 [2019-08-05 10:54:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:35,077 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-08-05 10:54:35,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:54:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-08-05 10:54:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:54:35,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:35,078 INFO L399 BasicCegarLoop]: trace histogram [95, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:35,078 INFO L418 AbstractCegarLoop]: === Iteration 97 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:35,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash 163323160, now seen corresponding path program 94 times [2019-08-05 10:54:35,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:35,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:54:35,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4564 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:39,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:39,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:54:39,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:54:39,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:54:39,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:54:39,633 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 98 states. [2019-08-05 10:54:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:39,884 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-08-05 10:54:39,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:54:39,885 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 108 [2019-08-05 10:54:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:39,885 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:54:39,885 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:54:39,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:54:39,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:54:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:54:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:54:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-08-05 10:54:39,888 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 108 [2019-08-05 10:54:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:39,889 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-08-05 10:54:39,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:54:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-08-05 10:54:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:54:39,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:39,890 INFO L399 BasicCegarLoop]: trace histogram [96, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:39,890 INFO L418 AbstractCegarLoop]: === Iteration 98 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2113060274, now seen corresponding path program 95 times [2019-08-05 10:54:39,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:39,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:54:39,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4660 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:44,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:44,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:54:44,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:54:44,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:54:44,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:54:44,242 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 99 states. [2019-08-05 10:54:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:44,588 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2019-08-05 10:54:44,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:54:44,588 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 109 [2019-08-05 10:54:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:44,589 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:54:44,589 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:54:44,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:54:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:54:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:54:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:54:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2019-08-05 10:54:44,592 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 109 [2019-08-05 10:54:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:44,593 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2019-08-05 10:54:44,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:54:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2019-08-05 10:54:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:54:44,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:44,593 INFO L399 BasicCegarLoop]: trace histogram [97, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:44,593 INFO L418 AbstractCegarLoop]: === Iteration 99 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:44,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1869598632, now seen corresponding path program 96 times [2019-08-05 10:54:44,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:44,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:54:44,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4757 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:48,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:48,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:54:48,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:54:48,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:54:48,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:54:48,657 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 100 states. [2019-08-05 10:54:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:48,942 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-08-05 10:54:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:54:48,942 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 110 [2019-08-05 10:54:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:48,943 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:54:48,943 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:54:48,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:54:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:54:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:54:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:54:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2019-08-05 10:54:48,946 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 110 [2019-08-05 10:54:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:48,946 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2019-08-05 10:54:48,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:54:48,946 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2019-08-05 10:54:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:54:48,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:48,947 INFO L399 BasicCegarLoop]: trace histogram [98, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:48,947 INFO L418 AbstractCegarLoop]: === Iteration 100 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:48,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash -777973134, now seen corresponding path program 97 times [2019-08-05 10:54:48,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:48,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:54:48,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4855 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:53,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:53,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:54:53,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:54:53,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:54:53,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:54:53,313 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 101 states. [2019-08-05 10:54:53,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:53,471 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2019-08-05 10:54:53,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:54:53,472 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 111 [2019-08-05 10:54:53,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:53,473 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:54:53,473 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:54:53,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:54:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:54:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:54:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:54:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2019-08-05 10:54:53,476 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 111 [2019-08-05 10:54:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:53,476 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2019-08-05 10:54:53,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:54:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2019-08-05 10:54:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:54:53,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:53,477 INFO L399 BasicCegarLoop]: trace histogram [99, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:53,477 INFO L418 AbstractCegarLoop]: === Iteration 101 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:53,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:53,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1297321064, now seen corresponding path program 98 times [2019-08-05 10:54:53,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:53,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:54:53,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4954 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:57,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:57,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:54:57,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:54:57,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:54:57,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:54:57,932 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 102 states. [2019-08-05 10:54:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:58,234 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-08-05 10:54:58,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:54:58,235 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 112 [2019-08-05 10:54:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:58,236 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:54:58,236 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:54:58,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:54:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:54:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:54:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:54:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2019-08-05 10:54:58,239 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 112 [2019-08-05 10:54:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:58,239 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2019-08-05 10:54:58,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:54:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2019-08-05 10:54:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:54:58,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:58,240 INFO L399 BasicCegarLoop]: trace histogram [100, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:58,241 INFO L418 AbstractCegarLoop]: === Iteration 102 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -217237710, now seen corresponding path program 99 times [2019-08-05 10:54:58,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:58,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:54:58,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5054 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:54:58,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:58,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:54:58,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:54:58,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:54:58,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:54:58,368 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 6 states. [2019-08-05 10:54:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:58,416 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2019-08-05 10:54:58,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:54:58,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-08-05 10:54:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:58,417 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:54:58,418 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:54:58,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:54:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:54:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-08-05 10:54:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:54:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2019-08-05 10:54:58,422 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 113 [2019-08-05 10:54:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:58,423 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2019-08-05 10:54:58,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:54:58,423 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2019-08-05 10:54:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:54:58,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:58,425 INFO L399 BasicCegarLoop]: trace histogram [100, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:58,425 INFO L418 AbstractCegarLoop]: === Iteration 103 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:58,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:58,425 INFO L82 PathProgramCache]: Analyzing trace with hash -301604038, now seen corresponding path program 100 times [2019-08-05 10:54:58,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:58,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:54:58,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5062 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:54:58,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:58,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:54:58,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:54:58,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:54:58,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:54:58,514 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand 7 states. [2019-08-05 10:54:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:58,567 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2019-08-05 10:54:58,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:54:58,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-08-05 10:54:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:58,569 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:54:58,569 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 10:54:58,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:54:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 10:54:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2019-08-05 10:54:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:54:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2019-08-05 10:54:58,572 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 117 [2019-08-05 10:54:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:58,573 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2019-08-05 10:54:58,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:54:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2019-08-05 10:54:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:54:58,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:58,574 INFO L399 BasicCegarLoop]: trace histogram [100, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:58,574 INFO L418 AbstractCegarLoop]: === Iteration 104 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:58,575 INFO L82 PathProgramCache]: Analyzing trace with hash 624511810, now seen corresponding path program 101 times [2019-08-05 10:54:58,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:58,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:54:58,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5074 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:54:58,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:58,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:54:58,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:54:58,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:54:58,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:54:58,695 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 8 states. [2019-08-05 10:54:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:58,746 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2019-08-05 10:54:58,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:54:58,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 121 [2019-08-05 10:54:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:58,748 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:54:58,748 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:54:58,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:54:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:54:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2019-08-05 10:54:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 10:54:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2019-08-05 10:54:58,751 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 121 [2019-08-05 10:54:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:58,751 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2019-08-05 10:54:58,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:54:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2019-08-05 10:54:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 10:54:58,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:58,752 INFO L399 BasicCegarLoop]: trace histogram [100, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:58,752 INFO L418 AbstractCegarLoop]: === Iteration 105 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:58,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:58,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1156149066, now seen corresponding path program 102 times [2019-08-05 10:54:58,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:58,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:54:58,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5090 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:54:58,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:58,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:54:58,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:54:58,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:54:58,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:54:58,873 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand 9 states. [2019-08-05 10:54:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:58,927 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2019-08-05 10:54:58,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:54:58,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-08-05 10:54:58,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:58,928 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:54:58,928 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:54:58,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:54:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:54:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2019-08-05 10:54:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:54:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2019-08-05 10:54:58,931 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 125 [2019-08-05 10:54:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:58,932 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2019-08-05 10:54:58,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:54:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2019-08-05 10:54:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 10:54:58,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:58,933 INFO L399 BasicCegarLoop]: trace histogram [100, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:58,933 INFO L418 AbstractCegarLoop]: === Iteration 106 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:58,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash 140005202, now seen corresponding path program 103 times [2019-08-05 10:54:58,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:58,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:54:58,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:54:59,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:59,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:54:59,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:54:59,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:54:59,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:54:59,043 INFO L87 Difference]: Start difference. First operand 132 states and 147 transitions. Second operand 10 states. [2019-08-05 10:54:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:59,113 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2019-08-05 10:54:59,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:54:59,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2019-08-05 10:54:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:59,115 INFO L225 Difference]: With dead ends: 144 [2019-08-05 10:54:59,115 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 10:54:59,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:54:59,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 10:54:59,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2019-08-05 10:54:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:54:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 153 transitions. [2019-08-05 10:54:59,118 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 153 transitions. Word has length 129 [2019-08-05 10:54:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:59,119 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 153 transitions. [2019-08-05 10:54:59,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:54:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 153 transitions. [2019-08-05 10:54:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:54:59,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:59,120 INFO L399 BasicCegarLoop]: trace histogram [100, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:59,120 INFO L418 AbstractCegarLoop]: === Iteration 107 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1178080422, now seen corresponding path program 104 times [2019-08-05 10:54:59,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:59,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:54:59,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5134 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:54:59,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:59,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:54:59,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:54:59,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:54:59,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:54:59,383 INFO L87 Difference]: Start difference. First operand 136 states and 153 transitions. Second operand 11 states. [2019-08-05 10:54:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:59,486 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2019-08-05 10:54:59,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:54:59,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 133 [2019-08-05 10:54:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:59,487 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:54:59,487 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:54:59,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 123 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-05 10:54:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:54:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2019-08-05 10:54:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:54:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2019-08-05 10:54:59,490 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 133 [2019-08-05 10:54:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:59,490 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2019-08-05 10:54:59,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:54:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2019-08-05 10:54:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 10:54:59,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:59,491 INFO L399 BasicCegarLoop]: trace histogram [100, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:59,491 INFO L418 AbstractCegarLoop]: === Iteration 108 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:59,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:59,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1300610206, now seen corresponding path program 105 times [2019-08-05 10:54:59,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:59,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:54:59,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5162 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:54:59,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:59,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:54:59,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:54:59,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:54:59,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:54:59,696 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand 12 states. [2019-08-05 10:54:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:59,776 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2019-08-05 10:54:59,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:54:59,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-08-05 10:54:59,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:59,777 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:54:59,778 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:54:59,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:54:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:54:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2019-08-05 10:54:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:54:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 165 transitions. [2019-08-05 10:54:59,781 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 165 transitions. Word has length 137 [2019-08-05 10:54:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:59,781 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 165 transitions. [2019-08-05 10:54:59,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:54:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 165 transitions. [2019-08-05 10:54:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:54:59,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:59,782 INFO L399 BasicCegarLoop]: trace histogram [100, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1] [2019-08-05 10:54:59,782 INFO L418 AbstractCegarLoop]: === Iteration 109 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:59,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:59,783 INFO L82 PathProgramCache]: Analyzing trace with hash -625911958, now seen corresponding path program 106 times [2019-08-05 10:54:59,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:59,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:54:59,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:54:59,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:59,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:54:59,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:54:59,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:54:59,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:54:59,964 INFO L87 Difference]: Start difference. First operand 144 states and 165 transitions. Second operand 13 states. [2019-08-05 10:55:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:00,049 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2019-08-05 10:55:00,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:55:00,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 141 [2019-08-05 10:55:00,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:00,051 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:55:00,051 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:55:00,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:55:00,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:55:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2019-08-05 10:55:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:55:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 171 transitions. [2019-08-05 10:55:00,054 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 171 transitions. Word has length 141 [2019-08-05 10:55:00,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:00,054 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 171 transitions. [2019-08-05 10:55:00,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:55:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 171 transitions. [2019-08-05 10:55:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 10:55:00,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:00,055 INFO L399 BasicCegarLoop]: trace histogram [100, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:00,055 INFO L418 AbstractCegarLoop]: === Iteration 110 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:00,056 INFO L82 PathProgramCache]: Analyzing trace with hash 699344754, now seen corresponding path program 107 times [2019-08-05 10:55:00,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:00,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:55:00,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5230 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:00,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:00,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:55:00,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:55:00,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:55:00,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:55:00,229 INFO L87 Difference]: Start difference. First operand 148 states and 171 transitions. Second operand 14 states. [2019-08-05 10:55:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:00,318 INFO L93 Difference]: Finished difference Result 164 states and 190 transitions. [2019-08-05 10:55:00,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:55:00,319 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2019-08-05 10:55:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:00,320 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:55:00,320 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 10:55:00,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:55:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 10:55:00,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-08-05 10:55:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 10:55:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2019-08-05 10:55:00,323 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 145 [2019-08-05 10:55:00,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:00,324 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2019-08-05 10:55:00,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:55:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2019-08-05 10:55:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 10:55:00,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:00,325 INFO L399 BasicCegarLoop]: trace histogram [100, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:00,325 INFO L418 AbstractCegarLoop]: === Iteration 111 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:00,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:00,325 INFO L82 PathProgramCache]: Analyzing trace with hash 632664954, now seen corresponding path program 108 times [2019-08-05 10:55:00,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:00,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:55:00,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5270 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:00,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:00,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:55:00,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:55:00,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:55:00,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:55:00,569 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand 15 states. [2019-08-05 10:55:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:00,664 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2019-08-05 10:55:00,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:55:00,665 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 149 [2019-08-05 10:55:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:00,666 INFO L225 Difference]: With dead ends: 169 [2019-08-05 10:55:00,666 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 10:55:00,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:55:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 10:55:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 156. [2019-08-05 10:55:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:55:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2019-08-05 10:55:00,669 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 149 [2019-08-05 10:55:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:00,669 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2019-08-05 10:55:00,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:55:00,669 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2019-08-05 10:55:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 10:55:00,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:00,670 INFO L399 BasicCegarLoop]: trace histogram [100, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:00,670 INFO L418 AbstractCegarLoop]: === Iteration 112 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:00,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:00,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1678179202, now seen corresponding path program 109 times [2019-08-05 10:55:00,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:00,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:55:00,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5314 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:00,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:00,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:55:00,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:55:00,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:55:00,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:55:00,865 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand 16 states. [2019-08-05 10:55:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:00,979 INFO L93 Difference]: Finished difference Result 174 states and 204 transitions. [2019-08-05 10:55:00,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:55:00,979 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 153 [2019-08-05 10:55:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:00,980 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:55:00,980 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:55:00,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:55:00,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:55:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2019-08-05 10:55:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:55:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2019-08-05 10:55:00,984 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 153 [2019-08-05 10:55:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:00,984 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2019-08-05 10:55:00,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:55:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2019-08-05 10:55:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 10:55:00,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:00,985 INFO L399 BasicCegarLoop]: trace histogram [100, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:00,985 INFO L418 AbstractCegarLoop]: === Iteration 113 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:00,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash 149225354, now seen corresponding path program 110 times [2019-08-05 10:55:00,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:01,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:55:01,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5362 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:01,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:01,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:55:01,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:55:01,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:55:01,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:55:01,310 INFO L87 Difference]: Start difference. First operand 160 states and 189 transitions. Second operand 17 states. [2019-08-05 10:55:01,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:01,433 INFO L93 Difference]: Finished difference Result 179 states and 211 transitions. [2019-08-05 10:55:01,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:55:01,433 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 157 [2019-08-05 10:55:01,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:01,434 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:55:01,434 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:55:01,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:55:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:55:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 164. [2019-08-05 10:55:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:55:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 195 transitions. [2019-08-05 10:55:01,437 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 195 transitions. Word has length 157 [2019-08-05 10:55:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:01,437 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 195 transitions. [2019-08-05 10:55:01,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:55:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 195 transitions. [2019-08-05 10:55:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 10:55:01,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:01,438 INFO L399 BasicCegarLoop]: trace histogram [100, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:01,438 INFO L418 AbstractCegarLoop]: === Iteration 114 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1200734098, now seen corresponding path program 111 times [2019-08-05 10:55:01,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:01,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:55:01,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5414 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:01,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:01,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:55:01,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:55:01,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:55:01,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:55:01,651 INFO L87 Difference]: Start difference. First operand 164 states and 195 transitions. Second operand 18 states. [2019-08-05 10:55:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:01,835 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2019-08-05 10:55:01,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:55:01,835 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 161 [2019-08-05 10:55:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:01,836 INFO L225 Difference]: With dead ends: 184 [2019-08-05 10:55:01,836 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 10:55:01,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:55:01,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 10:55:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 168. [2019-08-05 10:55:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:55:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 201 transitions. [2019-08-05 10:55:01,840 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 201 transitions. Word has length 161 [2019-08-05 10:55:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:01,840 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 201 transitions. [2019-08-05 10:55:01,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:55:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 201 transitions. [2019-08-05 10:55:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 10:55:01,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:01,841 INFO L399 BasicCegarLoop]: trace histogram [100, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:01,841 INFO L418 AbstractCegarLoop]: === Iteration 115 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:01,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:01,842 INFO L82 PathProgramCache]: Analyzing trace with hash -498123878, now seen corresponding path program 112 times [2019-08-05 10:55:01,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:01,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:55:01,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5470 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:02,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:02,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:55:02,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:55:02,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:55:02,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:55:02,115 INFO L87 Difference]: Start difference. First operand 168 states and 201 transitions. Second operand 19 states. [2019-08-05 10:55:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:02,242 INFO L93 Difference]: Finished difference Result 189 states and 225 transitions. [2019-08-05 10:55:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:55:02,242 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 165 [2019-08-05 10:55:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:02,243 INFO L225 Difference]: With dead ends: 189 [2019-08-05 10:55:02,243 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 10:55:02,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:55:02,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 10:55:02,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 172. [2019-08-05 10:55:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:55:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2019-08-05 10:55:02,247 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 165 [2019-08-05 10:55:02,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:02,247 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2019-08-05 10:55:02,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:55:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2019-08-05 10:55:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 10:55:02,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:02,248 INFO L399 BasicCegarLoop]: trace histogram [100, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:02,248 INFO L418 AbstractCegarLoop]: === Iteration 116 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:02,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1436585054, now seen corresponding path program 113 times [2019-08-05 10:55:02,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:02,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:55:02,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5530 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:02,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:02,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:55:02,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:55:02,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:55:02,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:55:02,631 INFO L87 Difference]: Start difference. First operand 172 states and 207 transitions. Second operand 20 states. [2019-08-05 10:55:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:02,754 INFO L93 Difference]: Finished difference Result 194 states and 232 transitions. [2019-08-05 10:55:02,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:55:02,755 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 169 [2019-08-05 10:55:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:02,756 INFO L225 Difference]: With dead ends: 194 [2019-08-05 10:55:02,756 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 10:55:02,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:55:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 10:55:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2019-08-05 10:55:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 10:55:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 213 transitions. [2019-08-05 10:55:02,761 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 213 transitions. Word has length 169 [2019-08-05 10:55:02,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:02,761 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 213 transitions. [2019-08-05 10:55:02,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:55:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 213 transitions. [2019-08-05 10:55:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:55:02,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:02,762 INFO L399 BasicCegarLoop]: trace histogram [100, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:02,763 INFO L418 AbstractCegarLoop]: === Iteration 117 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:02,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:02,763 INFO L82 PathProgramCache]: Analyzing trace with hash 288682, now seen corresponding path program 114 times [2019-08-05 10:55:02,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:02,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:55:02,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5594 backedges. 0 proven. 544 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:03,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:03,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:55:03,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:55:03,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:55:03,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:55:03,132 INFO L87 Difference]: Start difference. First operand 176 states and 213 transitions. Second operand 21 states. [2019-08-05 10:55:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:03,281 INFO L93 Difference]: Finished difference Result 199 states and 239 transitions. [2019-08-05 10:55:03,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:55:03,281 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 173 [2019-08-05 10:55:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:03,282 INFO L225 Difference]: With dead ends: 199 [2019-08-05 10:55:03,282 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 10:55:03,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:55:03,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 10:55:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2019-08-05 10:55:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:55:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 219 transitions. [2019-08-05 10:55:03,287 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 219 transitions. Word has length 173 [2019-08-05 10:55:03,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:03,287 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 219 transitions. [2019-08-05 10:55:03,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:55:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 219 transitions. [2019-08-05 10:55:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:55:03,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:03,288 INFO L399 BasicCegarLoop]: trace histogram [100, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:03,288 INFO L418 AbstractCegarLoop]: === Iteration 118 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:03,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1384126386, now seen corresponding path program 115 times [2019-08-05 10:55:03,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:03,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:55:03,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5662 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:03,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:03,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:55:03,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:55:03,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:55:03,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:55:03,600 INFO L87 Difference]: Start difference. First operand 180 states and 219 transitions. Second operand 22 states. [2019-08-05 10:55:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:04,126 INFO L93 Difference]: Finished difference Result 204 states and 246 transitions. [2019-08-05 10:55:04,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:55:04,127 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 177 [2019-08-05 10:55:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:04,127 INFO L225 Difference]: With dead ends: 204 [2019-08-05 10:55:04,127 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 10:55:04,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:55:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 10:55:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 184. [2019-08-05 10:55:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:55:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 225 transitions. [2019-08-05 10:55:04,130 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 225 transitions. Word has length 177 [2019-08-05 10:55:04,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:04,130 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 225 transitions. [2019-08-05 10:55:04,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:55:04,130 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 225 transitions. [2019-08-05 10:55:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 10:55:04,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:04,131 INFO L399 BasicCegarLoop]: trace histogram [100, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:04,131 INFO L418 AbstractCegarLoop]: === Iteration 119 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1609268294, now seen corresponding path program 116 times [2019-08-05 10:55:04,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:04,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:55:04,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5734 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:04,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:04,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:55:04,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:55:04,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:55:04,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:55:04,889 INFO L87 Difference]: Start difference. First operand 184 states and 225 transitions. Second operand 23 states. [2019-08-05 10:55:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:05,051 INFO L93 Difference]: Finished difference Result 209 states and 253 transitions. [2019-08-05 10:55:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:55:05,051 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 181 [2019-08-05 10:55:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:05,052 INFO L225 Difference]: With dead ends: 209 [2019-08-05 10:55:05,052 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 10:55:05,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:55:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 10:55:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 188. [2019-08-05 10:55:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 10:55:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 231 transitions. [2019-08-05 10:55:05,055 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 231 transitions. Word has length 181 [2019-08-05 10:55:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:05,056 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 231 transitions. [2019-08-05 10:55:05,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:55:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 231 transitions. [2019-08-05 10:55:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 10:55:05,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:05,057 INFO L399 BasicCegarLoop]: trace histogram [100, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:05,057 INFO L418 AbstractCegarLoop]: === Iteration 120 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:05,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:05,057 INFO L82 PathProgramCache]: Analyzing trace with hash -167531582, now seen corresponding path program 117 times [2019-08-05 10:55:05,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:05,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:55:05,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5810 backedges. 0 proven. 760 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:05,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:05,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:55:05,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:55:05,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:55:05,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:55:05,480 INFO L87 Difference]: Start difference. First operand 188 states and 231 transitions. Second operand 24 states. [2019-08-05 10:55:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:05,708 INFO L93 Difference]: Finished difference Result 214 states and 260 transitions. [2019-08-05 10:55:05,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:55:05,708 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 185 [2019-08-05 10:55:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:05,710 INFO L225 Difference]: With dead ends: 214 [2019-08-05 10:55:05,710 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 10:55:05,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:55:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 10:55:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 192. [2019-08-05 10:55:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 10:55:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 237 transitions. [2019-08-05 10:55:05,712 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 237 transitions. Word has length 185 [2019-08-05 10:55:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:05,712 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 237 transitions. [2019-08-05 10:55:05,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:55:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 237 transitions. [2019-08-05 10:55:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 10:55:05,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:05,713 INFO L399 BasicCegarLoop]: trace histogram [100, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:05,713 INFO L418 AbstractCegarLoop]: === Iteration 121 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:05,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:05,714 INFO L82 PathProgramCache]: Analyzing trace with hash -259026998, now seen corresponding path program 118 times [2019-08-05 10:55:05,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:05,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:55:05,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:06,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:06,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:55:06,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:55:06,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:55:06,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:55:06,080 INFO L87 Difference]: Start difference. First operand 192 states and 237 transitions. Second operand 25 states. [2019-08-05 10:55:06,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:06,428 INFO L93 Difference]: Finished difference Result 219 states and 267 transitions. [2019-08-05 10:55:06,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:55:06,429 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 189 [2019-08-05 10:55:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:06,430 INFO L225 Difference]: With dead ends: 219 [2019-08-05 10:55:06,430 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 10:55:06,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:55:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 10:55:06,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 196. [2019-08-05 10:55:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:55:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 243 transitions. [2019-08-05 10:55:06,433 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 243 transitions. Word has length 189 [2019-08-05 10:55:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:06,433 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 243 transitions. [2019-08-05 10:55:06,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:55:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 243 transitions. [2019-08-05 10:55:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 10:55:06,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:06,434 INFO L399 BasicCegarLoop]: trace histogram [100, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:06,435 INFO L418 AbstractCegarLoop]: === Iteration 122 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:06,435 INFO L82 PathProgramCache]: Analyzing trace with hash 989474770, now seen corresponding path program 119 times [2019-08-05 10:55:06,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:06,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:55:06,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5974 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:06,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:06,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:55:06,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:55:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:55:06,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:55:06,881 INFO L87 Difference]: Start difference. First operand 196 states and 243 transitions. Second operand 26 states. [2019-08-05 10:55:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:07,083 INFO L93 Difference]: Finished difference Result 224 states and 274 transitions. [2019-08-05 10:55:07,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:55:07,083 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 193 [2019-08-05 10:55:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:07,084 INFO L225 Difference]: With dead ends: 224 [2019-08-05 10:55:07,084 INFO L226 Difference]: Without dead ends: 224 [2019-08-05 10:55:07,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:55:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-08-05 10:55:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 200. [2019-08-05 10:55:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:55:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 249 transitions. [2019-08-05 10:55:07,087 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 249 transitions. Word has length 193 [2019-08-05 10:55:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:07,088 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 249 transitions. [2019-08-05 10:55:07,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:55:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 249 transitions. [2019-08-05 10:55:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 10:55:07,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:07,089 INFO L399 BasicCegarLoop]: trace histogram [100, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:07,089 INFO L418 AbstractCegarLoop]: === Iteration 123 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:07,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash 260410330, now seen corresponding path program 120 times [2019-08-05 10:55:07,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:07,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:55:07,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:07,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6062 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:07,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:07,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:55:07,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:55:07,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:55:07,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:55:07,550 INFO L87 Difference]: Start difference. First operand 200 states and 249 transitions. Second operand 27 states. [2019-08-05 10:55:07,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:07,752 INFO L93 Difference]: Finished difference Result 229 states and 281 transitions. [2019-08-05 10:55:07,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:55:07,752 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 197 [2019-08-05 10:55:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:07,753 INFO L225 Difference]: With dead ends: 229 [2019-08-05 10:55:07,754 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 10:55:07,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:55:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 10:55:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 204. [2019-08-05 10:55:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 10:55:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 255 transitions. [2019-08-05 10:55:07,756 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 255 transitions. Word has length 197 [2019-08-05 10:55:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:07,756 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 255 transitions. [2019-08-05 10:55:07,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:55:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 255 transitions. [2019-08-05 10:55:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 10:55:07,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:07,757 INFO L399 BasicCegarLoop]: trace histogram [100, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:07,757 INFO L418 AbstractCegarLoop]: === Iteration 124 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:07,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:07,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1217158174, now seen corresponding path program 121 times [2019-08-05 10:55:07,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:07,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:55:07,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6154 backedges. 0 proven. 1104 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:08,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:08,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:55:08,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:55:08,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:55:08,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:55:08,627 INFO L87 Difference]: Start difference. First operand 204 states and 255 transitions. Second operand 28 states. [2019-08-05 10:55:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:08,974 INFO L93 Difference]: Finished difference Result 234 states and 288 transitions. [2019-08-05 10:55:08,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:55:08,975 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 201 [2019-08-05 10:55:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:08,976 INFO L225 Difference]: With dead ends: 234 [2019-08-05 10:55:08,976 INFO L226 Difference]: Without dead ends: 234 [2019-08-05 10:55:08,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:55:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-08-05 10:55:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 208. [2019-08-05 10:55:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 10:55:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 261 transitions. [2019-08-05 10:55:08,978 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 261 transitions. Word has length 201 [2019-08-05 10:55:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:08,978 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 261 transitions. [2019-08-05 10:55:08,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:55:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 261 transitions. [2019-08-05 10:55:08,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-08-05 10:55:08,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:08,980 INFO L399 BasicCegarLoop]: trace histogram [100, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:08,980 INFO L418 AbstractCegarLoop]: === Iteration 125 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:08,980 INFO L82 PathProgramCache]: Analyzing trace with hash 184973290, now seen corresponding path program 122 times [2019-08-05 10:55:08,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:09,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:55:09,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6250 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:09,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:09,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:55:09,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:55:09,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:55:09,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:55:09,489 INFO L87 Difference]: Start difference. First operand 208 states and 261 transitions. Second operand 29 states. [2019-08-05 10:55:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:09,786 INFO L93 Difference]: Finished difference Result 239 states and 295 transitions. [2019-08-05 10:55:09,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:55:09,787 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 205 [2019-08-05 10:55:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:09,787 INFO L225 Difference]: With dead ends: 239 [2019-08-05 10:55:09,787 INFO L226 Difference]: Without dead ends: 239 [2019-08-05 10:55:09,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:55:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-08-05 10:55:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 212. [2019-08-05 10:55:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 10:55:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 267 transitions. [2019-08-05 10:55:09,790 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 267 transitions. Word has length 205 [2019-08-05 10:55:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:09,791 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 267 transitions. [2019-08-05 10:55:09,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:55:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 267 transitions. [2019-08-05 10:55:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-08-05 10:55:09,792 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:09,792 INFO L399 BasicCegarLoop]: trace histogram [100, 26, 26, 26, 25, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:09,792 INFO L418 AbstractCegarLoop]: === Iteration 126 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:09,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:09,792 INFO L82 PathProgramCache]: Analyzing trace with hash -243267598, now seen corresponding path program 123 times [2019-08-05 10:55:09,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:09,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:55:09,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6350 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:11,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:11,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:55:11,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:55:11,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:55:11,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:55:11,456 INFO L87 Difference]: Start difference. First operand 212 states and 267 transitions. Second operand 30 states. [2019-08-05 10:55:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:11,679 INFO L93 Difference]: Finished difference Result 244 states and 302 transitions. [2019-08-05 10:55:11,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:55:11,679 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 209 [2019-08-05 10:55:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:11,680 INFO L225 Difference]: With dead ends: 244 [2019-08-05 10:55:11,680 INFO L226 Difference]: Without dead ends: 244 [2019-08-05 10:55:11,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:55:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-08-05 10:55:11,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 216. [2019-08-05 10:55:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-08-05 10:55:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 273 transitions. [2019-08-05 10:55:11,684 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 273 transitions. Word has length 209 [2019-08-05 10:55:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:11,684 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 273 transitions. [2019-08-05 10:55:11,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:55:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 273 transitions. [2019-08-05 10:55:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 10:55:11,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:11,685 INFO L399 BasicCegarLoop]: trace histogram [100, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:11,685 INFO L418 AbstractCegarLoop]: === Iteration 127 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:11,685 INFO L82 PathProgramCache]: Analyzing trace with hash -517843974, now seen corresponding path program 124 times [2019-08-05 10:55:11,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:11,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:55:11,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6454 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:12,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:12,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:55:12,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:55:12,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:55:12,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:55:12,281 INFO L87 Difference]: Start difference. First operand 216 states and 273 transitions. Second operand 31 states. [2019-08-05 10:55:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:12,533 INFO L93 Difference]: Finished difference Result 249 states and 309 transitions. [2019-08-05 10:55:12,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:55:12,533 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 213 [2019-08-05 10:55:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:12,534 INFO L225 Difference]: With dead ends: 249 [2019-08-05 10:55:12,534 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 10:55:12,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:55:12,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 10:55:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 220. [2019-08-05 10:55:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:55:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2019-08-05 10:55:12,536 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 213 [2019-08-05 10:55:12,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:12,537 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2019-08-05 10:55:12,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:55:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2019-08-05 10:55:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 10:55:12,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:12,538 INFO L399 BasicCegarLoop]: trace histogram [100, 28, 28, 28, 27, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:12,538 INFO L418 AbstractCegarLoop]: === Iteration 128 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:12,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:12,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1596939266, now seen corresponding path program 125 times [2019-08-05 10:55:12,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:12,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:55:12,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6562 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:13,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:13,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:55:13,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:55:13,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:55:13,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:55:13,084 INFO L87 Difference]: Start difference. First operand 220 states and 279 transitions. Second operand 32 states. [2019-08-05 10:55:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:13,344 INFO L93 Difference]: Finished difference Result 254 states and 316 transitions. [2019-08-05 10:55:13,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:55:13,344 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 217 [2019-08-05 10:55:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:13,345 INFO L225 Difference]: With dead ends: 254 [2019-08-05 10:55:13,345 INFO L226 Difference]: Without dead ends: 254 [2019-08-05 10:55:13,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:55:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-08-05 10:55:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 224. [2019-08-05 10:55:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 10:55:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 285 transitions. [2019-08-05 10:55:13,349 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 285 transitions. Word has length 217 [2019-08-05 10:55:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:13,349 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 285 transitions. [2019-08-05 10:55:13,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:55:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 285 transitions. [2019-08-05 10:55:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-08-05 10:55:13,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:13,350 INFO L399 BasicCegarLoop]: trace histogram [100, 29, 29, 29, 28, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:13,351 INFO L418 AbstractCegarLoop]: === Iteration 129 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:13,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:13,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2145984522, now seen corresponding path program 126 times [2019-08-05 10:55:13,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:13,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:55:13,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6674 backedges. 0 proven. 1624 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:13,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:13,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:55:13,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:55:13,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:55:13,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:55:13,998 INFO L87 Difference]: Start difference. First operand 224 states and 285 transitions. Second operand 33 states. [2019-08-05 10:55:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:14,265 INFO L93 Difference]: Finished difference Result 259 states and 323 transitions. [2019-08-05 10:55:14,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:55:14,266 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 221 [2019-08-05 10:55:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:14,267 INFO L225 Difference]: With dead ends: 259 [2019-08-05 10:55:14,267 INFO L226 Difference]: Without dead ends: 259 [2019-08-05 10:55:14,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:55:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-08-05 10:55:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 228. [2019-08-05 10:55:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-08-05 10:55:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 291 transitions. [2019-08-05 10:55:14,270 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 291 transitions. Word has length 221 [2019-08-05 10:55:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:14,270 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 291 transitions. [2019-08-05 10:55:14,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:55:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 291 transitions. [2019-08-05 10:55:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-08-05 10:55:14,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:14,271 INFO L399 BasicCegarLoop]: trace histogram [100, 30, 30, 30, 29, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:14,271 INFO L418 AbstractCegarLoop]: === Iteration 130 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1720819730, now seen corresponding path program 127 times [2019-08-05 10:55:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:14,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:55:14,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6790 backedges. 0 proven. 1740 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:15,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:15,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:55:15,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:55:15,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:55:15,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:55:15,136 INFO L87 Difference]: Start difference. First operand 228 states and 291 transitions. Second operand 34 states. [2019-08-05 10:55:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:15,391 INFO L93 Difference]: Finished difference Result 264 states and 330 transitions. [2019-08-05 10:55:15,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:55:15,391 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 225 [2019-08-05 10:55:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:15,392 INFO L225 Difference]: With dead ends: 264 [2019-08-05 10:55:15,392 INFO L226 Difference]: Without dead ends: 264 [2019-08-05 10:55:15,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:55:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-08-05 10:55:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 232. [2019-08-05 10:55:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-08-05 10:55:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 297 transitions. [2019-08-05 10:55:15,396 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 297 transitions. Word has length 225 [2019-08-05 10:55:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:15,396 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 297 transitions. [2019-08-05 10:55:15,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:55:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 297 transitions. [2019-08-05 10:55:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-08-05 10:55:15,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:15,397 INFO L399 BasicCegarLoop]: trace histogram [100, 31, 31, 31, 30, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:15,397 INFO L418 AbstractCegarLoop]: === Iteration 131 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash -982852582, now seen corresponding path program 128 times [2019-08-05 10:55:15,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:15,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:55:15,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6910 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:16,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:16,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:55:16,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:55:16,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:55:16,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:55:16,124 INFO L87 Difference]: Start difference. First operand 232 states and 297 transitions. Second operand 35 states. [2019-08-05 10:55:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:16,410 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2019-08-05 10:55:16,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:55:16,411 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 229 [2019-08-05 10:55:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:16,412 INFO L225 Difference]: With dead ends: 269 [2019-08-05 10:55:16,412 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 10:55:16,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:55:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 10:55:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 236. [2019-08-05 10:55:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-08-05 10:55:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 303 transitions. [2019-08-05 10:55:16,415 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 303 transitions. Word has length 229 [2019-08-05 10:55:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:16,415 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 303 transitions. [2019-08-05 10:55:16,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:55:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 303 transitions. [2019-08-05 10:55:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-08-05 10:55:16,416 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:16,416 INFO L399 BasicCegarLoop]: trace histogram [100, 32, 32, 32, 31, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:16,416 INFO L418 AbstractCegarLoop]: === Iteration 132 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:16,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1572262946, now seen corresponding path program 129 times [2019-08-05 10:55:16,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:16,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:55:16,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7034 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:17,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:17,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:55:17,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:55:17,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:55:17,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:55:17,115 INFO L87 Difference]: Start difference. First operand 236 states and 303 transitions. Second operand 36 states. [2019-08-05 10:55:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:17,431 INFO L93 Difference]: Finished difference Result 274 states and 344 transitions. [2019-08-05 10:55:17,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:55:17,432 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 233 [2019-08-05 10:55:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:17,433 INFO L225 Difference]: With dead ends: 274 [2019-08-05 10:55:17,433 INFO L226 Difference]: Without dead ends: 274 [2019-08-05 10:55:17,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:55:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-08-05 10:55:17,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 240. [2019-08-05 10:55:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-08-05 10:55:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 309 transitions. [2019-08-05 10:55:17,436 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 309 transitions. Word has length 233 [2019-08-05 10:55:17,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:17,437 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 309 transitions. [2019-08-05 10:55:17,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:55:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 309 transitions. [2019-08-05 10:55:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-08-05 10:55:17,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:17,438 INFO L399 BasicCegarLoop]: trace histogram [100, 33, 33, 33, 32, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:17,438 INFO L418 AbstractCegarLoop]: === Iteration 133 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:17,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:17,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2142734378, now seen corresponding path program 130 times [2019-08-05 10:55:17,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:17,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:55:17,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7162 backedges. 0 proven. 2112 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:18,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:18,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:55:18,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:55:18,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:55:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:55:18,187 INFO L87 Difference]: Start difference. First operand 240 states and 309 transitions. Second operand 37 states. [2019-08-05 10:55:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:18,517 INFO L93 Difference]: Finished difference Result 279 states and 351 transitions. [2019-08-05 10:55:18,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:55:18,517 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 237 [2019-08-05 10:55:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:18,518 INFO L225 Difference]: With dead ends: 279 [2019-08-05 10:55:18,518 INFO L226 Difference]: Without dead ends: 279 [2019-08-05 10:55:18,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:55:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-08-05 10:55:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 244. [2019-08-05 10:55:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-08-05 10:55:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 315 transitions. [2019-08-05 10:55:18,522 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 315 transitions. Word has length 237 [2019-08-05 10:55:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:18,522 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 315 transitions. [2019-08-05 10:55:18,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:55:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 315 transitions. [2019-08-05 10:55:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-08-05 10:55:18,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:18,523 INFO L399 BasicCegarLoop]: trace histogram [100, 34, 34, 34, 33, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:18,523 INFO L418 AbstractCegarLoop]: === Iteration 134 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:18,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:18,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1968244686, now seen corresponding path program 131 times [2019-08-05 10:55:18,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:18,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:55:18,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7294 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:19,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:19,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:55:19,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:55:19,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:55:19,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:55:19,328 INFO L87 Difference]: Start difference. First operand 244 states and 315 transitions. Second operand 38 states. [2019-08-05 10:55:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:19,715 INFO L93 Difference]: Finished difference Result 284 states and 358 transitions. [2019-08-05 10:55:19,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:55:19,716 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 241 [2019-08-05 10:55:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:19,717 INFO L225 Difference]: With dead ends: 284 [2019-08-05 10:55:19,717 INFO L226 Difference]: Without dead ends: 284 [2019-08-05 10:55:19,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:55:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-08-05 10:55:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 248. [2019-08-05 10:55:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-08-05 10:55:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 321 transitions. [2019-08-05 10:55:19,720 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 321 transitions. Word has length 241 [2019-08-05 10:55:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:19,720 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 321 transitions. [2019-08-05 10:55:19,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:55:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 321 transitions. [2019-08-05 10:55:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-08-05 10:55:19,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:19,722 INFO L399 BasicCegarLoop]: trace histogram [100, 35, 35, 35, 34, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:19,722 INFO L418 AbstractCegarLoop]: === Iteration 135 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:19,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1826563130, now seen corresponding path program 132 times [2019-08-05 10:55:19,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:19,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:55:19,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7430 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:20,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:20,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:55:20,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:55:20,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:55:20,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:55:20,839 INFO L87 Difference]: Start difference. First operand 248 states and 321 transitions. Second operand 39 states. [2019-08-05 10:55:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:21,168 INFO L93 Difference]: Finished difference Result 289 states and 365 transitions. [2019-08-05 10:55:21,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:55:21,169 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 245 [2019-08-05 10:55:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:21,170 INFO L225 Difference]: With dead ends: 289 [2019-08-05 10:55:21,170 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 10:55:21,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:55:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 10:55:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 252. [2019-08-05 10:55:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-08-05 10:55:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 327 transitions. [2019-08-05 10:55:21,174 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 327 transitions. Word has length 245 [2019-08-05 10:55:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:21,174 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 327 transitions. [2019-08-05 10:55:21,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:55:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 327 transitions. [2019-08-05 10:55:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-08-05 10:55:21,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:21,175 INFO L399 BasicCegarLoop]: trace histogram [100, 36, 36, 36, 35, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:21,175 INFO L418 AbstractCegarLoop]: === Iteration 136 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:21,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:21,175 INFO L82 PathProgramCache]: Analyzing trace with hash 596249666, now seen corresponding path program 133 times [2019-08-05 10:55:21,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:21,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:55:21,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7570 backedges. 0 proven. 2520 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:21,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:21,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:55:21,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:55:21,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:55:21,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:55:21,989 INFO L87 Difference]: Start difference. First operand 252 states and 327 transitions. Second operand 40 states. [2019-08-05 10:55:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:22,345 INFO L93 Difference]: Finished difference Result 294 states and 372 transitions. [2019-08-05 10:55:22,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:55:22,345 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 249 [2019-08-05 10:55:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:22,346 INFO L225 Difference]: With dead ends: 294 [2019-08-05 10:55:22,346 INFO L226 Difference]: Without dead ends: 294 [2019-08-05 10:55:22,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:55:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-08-05 10:55:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 256. [2019-08-05 10:55:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-08-05 10:55:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 333 transitions. [2019-08-05 10:55:22,348 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 333 transitions. Word has length 249 [2019-08-05 10:55:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:22,348 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 333 transitions. [2019-08-05 10:55:22,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:55:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 333 transitions. [2019-08-05 10:55:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-08-05 10:55:22,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:22,350 INFO L399 BasicCegarLoop]: trace histogram [100, 37, 37, 37, 36, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:22,350 INFO L418 AbstractCegarLoop]: === Iteration 137 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:22,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:22,350 INFO L82 PathProgramCache]: Analyzing trace with hash 988917834, now seen corresponding path program 134 times [2019-08-05 10:55:22,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:22,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:55:22,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7714 backedges. 0 proven. 2664 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:23,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:23,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:55:23,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:55:23,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:55:23,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:55:23,221 INFO L87 Difference]: Start difference. First operand 256 states and 333 transitions. Second operand 41 states. [2019-08-05 10:55:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:23,602 INFO L93 Difference]: Finished difference Result 299 states and 379 transitions. [2019-08-05 10:55:23,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:55:23,603 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 253 [2019-08-05 10:55:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:23,604 INFO L225 Difference]: With dead ends: 299 [2019-08-05 10:55:23,604 INFO L226 Difference]: Without dead ends: 299 [2019-08-05 10:55:23,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:55:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-08-05 10:55:23,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 260. [2019-08-05 10:55:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-08-05 10:55:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 339 transitions. [2019-08-05 10:55:23,606 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 339 transitions. Word has length 253 [2019-08-05 10:55:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:23,607 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 339 transitions. [2019-08-05 10:55:23,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:55:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 339 transitions. [2019-08-05 10:55:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-08-05 10:55:23,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:23,608 INFO L399 BasicCegarLoop]: trace histogram [100, 38, 38, 38, 37, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:23,608 INFO L418 AbstractCegarLoop]: === Iteration 138 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:23,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:23,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1314394194, now seen corresponding path program 135 times [2019-08-05 10:55:23,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:23,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:55:23,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7862 backedges. 0 proven. 2812 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:24,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:24,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:55:24,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:55:24,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:55:24,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:55:24,533 INFO L87 Difference]: Start difference. First operand 260 states and 339 transitions. Second operand 42 states. [2019-08-05 10:55:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:25,036 INFO L93 Difference]: Finished difference Result 304 states and 386 transitions. [2019-08-05 10:55:25,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:55:25,036 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 257 [2019-08-05 10:55:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:25,037 INFO L225 Difference]: With dead ends: 304 [2019-08-05 10:55:25,037 INFO L226 Difference]: Without dead ends: 304 [2019-08-05 10:55:25,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:55:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-08-05 10:55:25,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 264. [2019-08-05 10:55:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-08-05 10:55:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 345 transitions. [2019-08-05 10:55:25,040 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 345 transitions. Word has length 257 [2019-08-05 10:55:25,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:25,041 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 345 transitions. [2019-08-05 10:55:25,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:55:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 345 transitions. [2019-08-05 10:55:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-08-05 10:55:25,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:25,041 INFO L399 BasicCegarLoop]: trace histogram [100, 39, 39, 39, 38, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:25,042 INFO L418 AbstractCegarLoop]: === Iteration 139 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:25,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:25,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2013320102, now seen corresponding path program 136 times [2019-08-05 10:55:25,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:25,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:55:25,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8014 backedges. 0 proven. 2964 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:26,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:26,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:55:26,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:55:26,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:55:26,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:55:26,022 INFO L87 Difference]: Start difference. First operand 264 states and 345 transitions. Second operand 43 states. [2019-08-05 10:55:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:26,408 INFO L93 Difference]: Finished difference Result 309 states and 393 transitions. [2019-08-05 10:55:26,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:55:26,408 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 261 [2019-08-05 10:55:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:26,409 INFO L225 Difference]: With dead ends: 309 [2019-08-05 10:55:26,410 INFO L226 Difference]: Without dead ends: 309 [2019-08-05 10:55:26,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:55:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-08-05 10:55:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 268. [2019-08-05 10:55:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 10:55:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 351 transitions. [2019-08-05 10:55:26,413 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 351 transitions. Word has length 261 [2019-08-05 10:55:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:26,413 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 351 transitions. [2019-08-05 10:55:26,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:55:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 351 transitions. [2019-08-05 10:55:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-08-05 10:55:26,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:26,414 INFO L399 BasicCegarLoop]: trace histogram [100, 40, 40, 40, 39, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:26,414 INFO L418 AbstractCegarLoop]: === Iteration 140 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:26,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:26,414 INFO L82 PathProgramCache]: Analyzing trace with hash 556336226, now seen corresponding path program 137 times [2019-08-05 10:55:26,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:26,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:55:26,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8170 backedges. 0 proven. 3120 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:27,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:27,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:55:27,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:55:27,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:55:27,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:55:27,355 INFO L87 Difference]: Start difference. First operand 268 states and 351 transitions. Second operand 44 states. [2019-08-05 10:55:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:27,771 INFO L93 Difference]: Finished difference Result 314 states and 400 transitions. [2019-08-05 10:55:27,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:55:27,771 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 265 [2019-08-05 10:55:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:27,772 INFO L225 Difference]: With dead ends: 314 [2019-08-05 10:55:27,772 INFO L226 Difference]: Without dead ends: 314 [2019-08-05 10:55:27,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:55:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-08-05 10:55:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 272. [2019-08-05 10:55:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-08-05 10:55:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 357 transitions. [2019-08-05 10:55:27,777 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 357 transitions. Word has length 265 [2019-08-05 10:55:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:27,777 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 357 transitions. [2019-08-05 10:55:27,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:55:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 357 transitions. [2019-08-05 10:55:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-08-05 10:55:27,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:27,778 INFO L399 BasicCegarLoop]: trace histogram [100, 41, 41, 41, 40, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:27,779 INFO L418 AbstractCegarLoop]: === Iteration 141 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:27,779 INFO L82 PathProgramCache]: Analyzing trace with hash -501770134, now seen corresponding path program 138 times [2019-08-05 10:55:27,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:27,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:55:27,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8330 backedges. 0 proven. 3280 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:28,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:28,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:55:28,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:55:28,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:55:28,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:55:28,869 INFO L87 Difference]: Start difference. First operand 272 states and 357 transitions. Second operand 45 states. [2019-08-05 10:55:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:29,296 INFO L93 Difference]: Finished difference Result 319 states and 407 transitions. [2019-08-05 10:55:29,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:55:29,297 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 269 [2019-08-05 10:55:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:29,298 INFO L225 Difference]: With dead ends: 319 [2019-08-05 10:55:29,298 INFO L226 Difference]: Without dead ends: 319 [2019-08-05 10:55:29,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:55:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-08-05 10:55:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 276. [2019-08-05 10:55:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-08-05 10:55:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 363 transitions. [2019-08-05 10:55:29,301 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 363 transitions. Word has length 269 [2019-08-05 10:55:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:29,302 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 363 transitions. [2019-08-05 10:55:29,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:55:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 363 transitions. [2019-08-05 10:55:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-08-05 10:55:29,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:29,303 INFO L399 BasicCegarLoop]: trace histogram [100, 42, 42, 42, 41, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:29,303 INFO L418 AbstractCegarLoop]: === Iteration 142 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:29,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:29,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1576212366, now seen corresponding path program 139 times [2019-08-05 10:55:29,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:29,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:55:29,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8494 backedges. 0 proven. 3444 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:30,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:30,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:55:30,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:55:30,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:55:30,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:55:30,505 INFO L87 Difference]: Start difference. First operand 276 states and 363 transitions. Second operand 46 states. [2019-08-05 10:55:30,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:30,952 INFO L93 Difference]: Finished difference Result 324 states and 414 transitions. [2019-08-05 10:55:30,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:55:30,952 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 273 [2019-08-05 10:55:30,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:30,953 INFO L225 Difference]: With dead ends: 324 [2019-08-05 10:55:30,953 INFO L226 Difference]: Without dead ends: 324 [2019-08-05 10:55:30,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:55:30,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-08-05 10:55:30,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2019-08-05 10:55:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-08-05 10:55:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 369 transitions. [2019-08-05 10:55:30,957 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 369 transitions. Word has length 273 [2019-08-05 10:55:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:30,958 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 369 transitions. [2019-08-05 10:55:30,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:55:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 369 transitions. [2019-08-05 10:55:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-08-05 10:55:30,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:30,959 INFO L399 BasicCegarLoop]: trace histogram [100, 43, 43, 43, 42, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:30,959 INFO L418 AbstractCegarLoop]: === Iteration 143 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash -951389062, now seen corresponding path program 140 times [2019-08-05 10:55:30,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:30,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:55:30,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8662 backedges. 0 proven. 3612 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:32,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:32,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:55:32,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:55:32,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:55:32,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:55:32,013 INFO L87 Difference]: Start difference. First operand 280 states and 369 transitions. Second operand 47 states. [2019-08-05 10:55:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:32,463 INFO L93 Difference]: Finished difference Result 329 states and 421 transitions. [2019-08-05 10:55:32,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:55:32,463 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 277 [2019-08-05 10:55:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:32,465 INFO L225 Difference]: With dead ends: 329 [2019-08-05 10:55:32,465 INFO L226 Difference]: Without dead ends: 329 [2019-08-05 10:55:32,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:55:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-08-05 10:55:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 284. [2019-08-05 10:55:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-08-05 10:55:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 375 transitions. [2019-08-05 10:55:32,469 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 375 transitions. Word has length 277 [2019-08-05 10:55:32,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:32,470 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 375 transitions. [2019-08-05 10:55:32,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:55:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 375 transitions. [2019-08-05 10:55:32,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-08-05 10:55:32,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:32,471 INFO L399 BasicCegarLoop]: trace histogram [100, 44, 44, 44, 43, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:32,471 INFO L418 AbstractCegarLoop]: === Iteration 144 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:32,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:32,472 INFO L82 PathProgramCache]: Analyzing trace with hash -955007870, now seen corresponding path program 141 times [2019-08-05 10:55:32,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:32,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:55:32,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8834 backedges. 0 proven. 3784 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:33,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:33,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:55:33,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:55:33,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:55:33,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:55:33,663 INFO L87 Difference]: Start difference. First operand 284 states and 375 transitions. Second operand 48 states. [2019-08-05 10:55:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:34,148 INFO L93 Difference]: Finished difference Result 334 states and 428 transitions. [2019-08-05 10:55:34,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:55:34,148 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 281 [2019-08-05 10:55:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:34,149 INFO L225 Difference]: With dead ends: 334 [2019-08-05 10:55:34,149 INFO L226 Difference]: Without dead ends: 334 [2019-08-05 10:55:34,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:55:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-08-05 10:55:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 288. [2019-08-05 10:55:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-08-05 10:55:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 381 transitions. [2019-08-05 10:55:34,153 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 381 transitions. Word has length 281 [2019-08-05 10:55:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:34,153 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 381 transitions. [2019-08-05 10:55:34,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:55:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 381 transitions. [2019-08-05 10:55:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-08-05 10:55:34,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:34,154 INFO L399 BasicCegarLoop]: trace histogram [100, 45, 45, 45, 44, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:34,155 INFO L418 AbstractCegarLoop]: === Iteration 145 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:34,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:34,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1515634550, now seen corresponding path program 142 times [2019-08-05 10:55:34,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:34,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:55:34,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9010 backedges. 0 proven. 3960 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:35,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:35,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:55:35,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:55:35,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:55:35,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:55:35,546 INFO L87 Difference]: Start difference. First operand 288 states and 381 transitions. Second operand 49 states. [2019-08-05 10:55:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:36,022 INFO L93 Difference]: Finished difference Result 339 states and 435 transitions. [2019-08-05 10:55:36,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:55:36,023 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 285 [2019-08-05 10:55:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:36,024 INFO L225 Difference]: With dead ends: 339 [2019-08-05 10:55:36,024 INFO L226 Difference]: Without dead ends: 339 [2019-08-05 10:55:36,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:55:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-08-05 10:55:36,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 292. [2019-08-05 10:55:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-08-05 10:55:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 387 transitions. [2019-08-05 10:55:36,028 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 387 transitions. Word has length 285 [2019-08-05 10:55:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:36,028 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 387 transitions. [2019-08-05 10:55:36,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:55:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 387 transitions. [2019-08-05 10:55:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-08-05 10:55:36,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:36,030 INFO L399 BasicCegarLoop]: trace histogram [100, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:36,030 INFO L418 AbstractCegarLoop]: === Iteration 146 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:36,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:36,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1984790674, now seen corresponding path program 143 times [2019-08-05 10:55:36,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:36,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:55:36,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9190 backedges. 0 proven. 4140 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:55:37,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:37,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:55:37,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:55:37,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:55:37,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:55:37,329 INFO L87 Difference]: Start difference. First operand 292 states and 387 transitions. Second operand 50 states. [2019-08-05 10:55:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:37,847 INFO L93 Difference]: Finished difference Result 344 states and 442 transitions. [2019-08-05 10:55:37,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:55:37,848 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 289 [2019-08-05 10:55:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:37,849 INFO L225 Difference]: With dead ends: 344 [2019-08-05 10:55:37,849 INFO L226 Difference]: Without dead ends: 344 [2019-08-05 10:55:37,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:55:37,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-08-05 10:55:37,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 296. [2019-08-05 10:55:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-08-05 10:55:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 393 transitions. [2019-08-05 10:55:37,852 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 393 transitions. Word has length 289 [2019-08-05 10:55:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:37,852 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 393 transitions. [2019-08-05 10:55:37,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:55:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 393 transitions. [2019-08-05 10:55:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-08-05 10:55:37,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:37,853 INFO L399 BasicCegarLoop]: trace histogram [100, 47, 47, 47, 46, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:37,853 INFO L418 AbstractCegarLoop]: === Iteration 147 === [nBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:37,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash -616399718, now seen corresponding path program 144 times [2019-08-05 10:55:37,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:37,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:55:37,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:55:38,301 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:55:38,301 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:55:38,305 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:55:38,306 INFO L202 PluginConnector]: Adding new model CounterLoop-nBit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:55:38 BoogieIcfgContainer [2019-08-05 10:55:38,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:55:38,308 INFO L168 Benchmark]: Toolchain (without parser) took 238447.20 ms. Allocated memory was 140.5 MB in the beginning and 792.2 MB in the end (delta: 651.7 MB). Free memory was 108.9 MB in the beginning and 692.6 MB in the end (delta: -583.7 MB). Peak memory consumption was 68.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:55:38,309 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:55:38,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.80 ms. Allocated memory is still 140.5 MB. Free memory was 108.5 MB in the beginning and 106.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:55:38,310 INFO L168 Benchmark]: Boogie Preprocessor took 23.04 ms. Allocated memory is still 140.5 MB. Free memory was 106.8 MB in the beginning and 105.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:55:38,310 INFO L168 Benchmark]: RCFGBuilder took 422.39 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 94.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:55:38,311 INFO L168 Benchmark]: TraceAbstraction took 237962.21 ms. Allocated memory was 140.5 MB in the beginning and 792.2 MB in the end (delta: 651.7 MB). Free memory was 94.5 MB in the beginning and 692.6 MB in the end (delta: -598.1 MB). Peak memory consumption was 53.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:55:38,313 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.80 ms. Allocated memory is still 140.5 MB. Free memory was 108.5 MB in the beginning and 106.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.04 ms. Allocated memory is still 140.5 MB. Free memory was 106.8 MB in the beginning and 105.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 422.39 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 94.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237962.21 ms. Allocated memory was 140.5 MB in the beginning and 792.2 MB in the end (delta: 651.7 MB). Free memory was 94.5 MB in the beginning and 692.6 MB in the end (delta: -598.1 MB). Peak memory consumption was 53.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 100,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 24 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. TIMEOUT Result, 237.9s OverallTime, 147 OverallIterations, 100 TraceHistogramMax, 29.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1577 SDtfs, 11257 SDslu, 11205 SDs, 0 SdLazy, 20062 SolverSat, 1489 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15148 GetRequests, 8925 SyntacticMatches, 0 SemanticMatches, 6223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 198.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 146 MinimizatonAttempts, 1173 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 204.4s InterpolantComputationTime, 15294 NumberOfCodeBlocks, 15294 NumberOfCodeBlocksAsserted, 146 NumberOfCheckSat, 15148 ConstructedInterpolants, 0 QuantifiedInterpolants, 12495138 SizeOfPredicates, 292 NumberOfNonLiveVariables, 50364 ConjunctsInSsa, 6469 ConjunctsInUnsatCore, 146 InterpolantComputations, 2 PerfectInterpolantSequences, 227645/459155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown